./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety-realloc/array-realloc-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7e1ff0e6 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/array-memsafety-realloc/array-realloc-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a7528f200456114b53348dcc6f65daa446d01523914ddd1f3b2ed0ccb2daf1cf --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 00:56:53,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 00:56:53,210 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 00:56:53,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 00:56:53,241 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 00:56:53,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 00:56:53,245 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 00:56:53,247 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 00:56:53,248 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 00:56:53,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 00:56:53,252 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 00:56:53,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 00:56:53,254 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 00:56:53,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 00:56:53,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 00:56:53,257 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 00:56:53,258 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 00:56:53,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 00:56:53,260 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 00:56:53,264 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 00:56:53,264 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 00:56:53,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 00:56:53,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 00:56:53,266 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 00:56:53,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 00:56:53,272 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 00:56:53,272 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 00:56:53,274 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 00:56:53,274 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 00:56:53,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 00:56:53,275 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 00:56:53,275 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 00:56:53,276 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 00:56:53,277 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 00:56:53,277 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 00:56:53,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 00:56:53,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 00:56:53,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 00:56:53,278 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 00:56:53,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 00:56:53,280 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 00:56:53,281 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 00:56:53,302 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 00:56:53,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 00:56:53,303 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 00:56:53,303 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 00:56:53,303 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 00:56:53,303 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 00:56:53,304 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 00:56:53,304 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 00:56:53,304 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 00:56:53,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 00:56:53,305 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 00:56:53,305 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 00:56:53,305 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 00:56:53,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 00:56:53,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 00:56:53,306 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 00:56:53,306 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 00:56:53,306 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 00:56:53,306 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 00:56:53,306 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 00:56:53,307 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 00:56:53,307 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 00:56:53,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 00:56:53,307 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 00:56:53,307 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 00:56:53,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 00:56:53,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 00:56:53,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 00:56:53,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 00:56:53,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 00:56:53,308 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 00:56:53,308 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 00:56:53,309 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 00:56:53,309 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 00:56:53,309 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> a7528f200456114b53348dcc6f65daa446d01523914ddd1f3b2ed0ccb2daf1cf [2023-02-15 00:56:53,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 00:56:53,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 00:56:53,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 00:56:53,516 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 00:56:53,517 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 00:56:53,518 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety-realloc/array-realloc-1.i [2023-02-15 00:56:54,465 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 00:56:54,698 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 00:56:54,698 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety-realloc/array-realloc-1.i [2023-02-15 00:56:54,705 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53cebf621/42ee94aadf19422fbe9fef565043bcba/FLAG0d2367e23 [2023-02-15 00:56:54,714 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53cebf621/42ee94aadf19422fbe9fef565043bcba [2023-02-15 00:56:54,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 00:56:54,717 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 00:56:54,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 00:56:54,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 00:56:54,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 00:56:54,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:56:54" (1/1) ... [2023-02-15 00:56:54,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a86c759 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:54, skipping insertion in model container [2023-02-15 00:56:54,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:56:54" (1/1) ... [2023-02-15 00:56:54,726 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 00:56:54,761 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 00:56:54,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 00:56:54,980 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) [2023-02-15 00:56:54,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@9e20bff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:54, skipping insertion in model container [2023-02-15 00:56:54,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 00:56:54,982 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-15 00:56:54,983 INFO L158 Benchmark]: Toolchain (without parser) took 265.83ms. Allocated memory is still 161.5MB. Free memory was 129.4MB in the beginning and 118.0MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 00:56:54,984 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 113.2MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 00:56:54,984 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.45ms. Allocated memory is still 161.5MB. Free memory was 129.4MB in the beginning and 118.0MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 00:56:54,985 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.13ms. Allocated memory is still 113.2MB. Free memory is still 66.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.45ms. Allocated memory is still 161.5MB. Free memory was 129.4MB in the beginning and 118.0MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 515]: 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/array-memsafety-realloc/array-realloc-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a7528f200456114b53348dcc6f65daa446d01523914ddd1f3b2ed0ccb2daf1cf --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 00:56:56,542 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 00:56:56,544 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 00:56:56,573 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 00:56:56,574 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 00:56:56,575 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 00:56:56,577 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 00:56:56,579 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 00:56:56,582 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 00:56:56,582 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 00:56:56,583 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 00:56:56,584 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 00:56:56,584 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 00:56:56,585 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 00:56:56,585 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 00:56:56,586 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 00:56:56,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 00:56:56,587 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 00:56:56,588 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 00:56:56,591 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 00:56:56,591 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 00:56:56,595 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 00:56:56,596 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 00:56:56,596 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 00:56:56,598 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 00:56:56,598 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 00:56:56,598 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 00:56:56,599 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 00:56:56,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 00:56:56,600 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 00:56:56,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 00:56:56,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 00:56:56,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 00:56:56,607 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 00:56:56,608 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 00:56:56,608 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 00:56:56,609 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 00:56:56,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 00:56:56,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 00:56:56,609 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 00:56:56,610 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 00:56:56,611 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 00:56:56,635 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 00:56:56,635 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 00:56:56,636 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 00:56:56,636 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 00:56:56,637 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 00:56:56,637 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 00:56:56,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 00:56:56,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 00:56:56,638 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 00:56:56,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 00:56:56,639 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 00:56:56,639 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 00:56:56,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 00:56:56,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 00:56:56,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 00:56:56,640 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 00:56:56,640 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 00:56:56,640 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 00:56:56,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 00:56:56,640 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 00:56:56,641 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 00:56:56,641 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 00:56:56,641 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 00:56:56,641 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 00:56:56,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 00:56:56,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 00:56:56,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 00:56:56,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 00:56:56,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 00:56:56,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 00:56:56,642 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 00:56:56,642 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 00:56:56,643 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 00:56:56,643 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 00:56:56,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 00:56:56,643 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 00:56:56,643 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 00:56:56,643 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> a7528f200456114b53348dcc6f65daa446d01523914ddd1f3b2ed0ccb2daf1cf [2023-02-15 00:56:56,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 00:56:56,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 00:56:56,894 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 00:56:56,895 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 00:56:56,895 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 00:56:56,897 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety-realloc/array-realloc-1.i [2023-02-15 00:56:57,850 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 00:56:58,097 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 00:56:58,101 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety-realloc/array-realloc-1.i [2023-02-15 00:56:58,114 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68248c4ae/7bbaca015d854769824891b5d20a1c1a/FLAG5866129b3 [2023-02-15 00:56:58,126 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68248c4ae/7bbaca015d854769824891b5d20a1c1a [2023-02-15 00:56:58,129 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 00:56:58,133 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 00:56:58,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 00:56:58,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 00:56:58,139 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 00:56:58,141 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:56:58" (1/1) ... [2023-02-15 00:56:58,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14617ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:58, skipping insertion in model container [2023-02-15 00:56:58,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:56:58" (1/1) ... [2023-02-15 00:56:58,151 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 00:56:58,187 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 00:56:58,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 00:56:58,395 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-15 00:56:58,405 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 00:56:58,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 00:56:58,439 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 00:56:58,456 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 00:56:58,477 INFO L208 MainTranslator]: Completed translation [2023-02-15 00:56:58,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:58 WrapperNode [2023-02-15 00:56:58,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 00:56:58,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 00:56:58,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 00:56:58,478 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 00:56:58,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:58" (1/1) ... [2023-02-15 00:56:58,505 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:58" (1/1) ... [2023-02-15 00:56:58,525 INFO L138 Inliner]: procedures = 118, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2023-02-15 00:56:58,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 00:56:58,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 00:56:58,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 00:56:58,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 00:56:58,533 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:58" (1/1) ... [2023-02-15 00:56:58,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:58" (1/1) ... [2023-02-15 00:56:58,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:58" (1/1) ... [2023-02-15 00:56:58,549 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:58" (1/1) ... [2023-02-15 00:56:58,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:58" (1/1) ... [2023-02-15 00:56:58,559 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:58" (1/1) ... [2023-02-15 00:56:58,561 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:58" (1/1) ... [2023-02-15 00:56:58,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:58" (1/1) ... [2023-02-15 00:56:58,563 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 00:56:58,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 00:56:58,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 00:56:58,564 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 00:56:58,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:58" (1/1) ... [2023-02-15 00:56:58,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 00:56:58,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 00:56:58,589 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 00:56:58,591 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 [2023-02-15 00:56:58,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 00:56:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 00:56:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-15 00:56:58,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 00:56:58,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 00:56:58,710 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 00:56:58,712 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 00:56:58,939 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 00:56:58,943 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 00:56:58,943 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2023-02-15 00:56:58,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:56:58 BoogieIcfgContainer [2023-02-15 00:56:58,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 00:56:58,946 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 00:56:58,946 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 00:56:58,948 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 00:56:58,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 12:56:58" (1/3) ... [2023-02-15 00:56:58,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0caaa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:56:58, skipping insertion in model container [2023-02-15 00:56:58,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:58" (2/3) ... [2023-02-15 00:56:58,949 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0caaa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:56:58, skipping insertion in model container [2023-02-15 00:56:58,949 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:56:58" (3/3) ... [2023-02-15 00:56:58,950 INFO L112 eAbstractionObserver]: Analyzing ICFG array-realloc-1.i [2023-02-15 00:56:58,961 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 00:56:58,962 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-02-15 00:56:58,999 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 00:56:59,005 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=PETRI_NET, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@128a8bfb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 00:56:59,005 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-02-15 00:56:59,009 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 20 states have (on average 1.75) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:59,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 00:56:59,013 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:56:59,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 00:56:59,013 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2023-02-15 00:56:59,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:56:59,019 INFO L85 PathProgramCache]: Analyzing trace with hash 925656, now seen corresponding path program 1 times [2023-02-15 00:56:59,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:56:59,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1877490392] [2023-02-15 00:56:59,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:56:59,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:56:59,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:56:59,032 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 00:56:59,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 00:56:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:56:59,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 00:56:59,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:56:59,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:56:59,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:56:59,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:56:59,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1877490392] [2023-02-15 00:56:59,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1877490392] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:56:59,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:56:59,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 00:56:59,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784030742] [2023-02-15 00:56:59,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:56:59,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 00:56:59,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:56:59,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 00:56:59,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 00:56:59,170 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.75) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2023-02-15 00:56:59,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:56:59,211 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2023-02-15 00:56:59,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 00:56:59,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-02-15 00:56:59,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:56:59,220 INFO L225 Difference]: With dead ends: 31 [2023-02-15 00:56:59,220 INFO L226 Difference]: Without dead ends: 28 [2023-02-15 00:56:59,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 00:56:59,224 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 00:56:59,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 00:56:59,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-15 00:56:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-15 00:56:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.631578947368421) internal successors, (31), 27 states have internal predecessors, (31), 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) [2023-02-15 00:56:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-02-15 00:56:59,250 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 4 [2023-02-15 00:56:59,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:56:59,250 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-02-15 00:56:59,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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) [2023-02-15 00:56:59,251 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-02-15 00:56:59,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 00:56:59,251 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:56:59,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 00:56:59,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-15 00:56:59,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:56:59,452 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2023-02-15 00:56:59,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:56:59,453 INFO L85 PathProgramCache]: Analyzing trace with hash 28695828, now seen corresponding path program 1 times [2023-02-15 00:56:59,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:56:59,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [822044885] [2023-02-15 00:56:59,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:56:59,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:56:59,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:56:59,455 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 00:56:59,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 00:56:59,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:56:59,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 00:56:59,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:56:59,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:56:59,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:56:59,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:56:59,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [822044885] [2023-02-15 00:56:59,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [822044885] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:56:59,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:56:59,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 00:56:59,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642184586] [2023-02-15 00:56:59,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:56:59,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 00:56:59,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:56:59,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 00:56:59,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 00:56:59,561 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-02-15 00:56:59,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:56:59,572 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2023-02-15 00:56:59,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 00:56:59,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-15 00:56:59,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:56:59,577 INFO L225 Difference]: With dead ends: 28 [2023-02-15 00:56:59,577 INFO L226 Difference]: Without dead ends: 28 [2023-02-15 00:56:59,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 00:56:59,578 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 00:56:59,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 26 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 00:56:59,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-15 00:56:59,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-15 00:56:59,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 27 states have internal predecessors, (30), 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) [2023-02-15 00:56:59,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2023-02-15 00:56:59,585 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 5 [2023-02-15 00:56:59,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:56:59,585 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2023-02-15 00:56:59,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) [2023-02-15 00:56:59,586 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2023-02-15 00:56:59,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 00:56:59,586 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:56:59,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:56:59,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 00:56:59,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:56:59,793 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2023-02-15 00:56:59,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:56:59,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1806910252, now seen corresponding path program 1 times [2023-02-15 00:56:59,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:56:59,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [955832103] [2023-02-15 00:56:59,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:56:59,797 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:56:59,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:56:59,799 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 00:56:59,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 00:56:59,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:56:59,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 00:56:59,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:56:59,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:56:59,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:56:59,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:56:59,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [955832103] [2023-02-15 00:56:59,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [955832103] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:56:59,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:56:59,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 00:56:59,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005008325] [2023-02-15 00:56:59,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:56:59,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 00:56:59,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:56:59,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 00:56:59,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 00:56:59,890 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-02-15 00:56:59,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:56:59,914 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2023-02-15 00:56:59,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 00:56:59,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-02-15 00:56:59,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:56:59,915 INFO L225 Difference]: With dead ends: 42 [2023-02-15 00:56:59,915 INFO L226 Difference]: Without dead ends: 42 [2023-02-15 00:56:59,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 00:56:59,916 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 00:56:59,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 45 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 00:56:59,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-02-15 00:56:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2023-02-15 00:56:59,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 29 states have internal predecessors, (33), 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) [2023-02-15 00:56:59,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2023-02-15 00:56:59,920 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 7 [2023-02-15 00:56:59,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:56:59,920 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-02-15 00:56:59,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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) [2023-02-15 00:56:59,920 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2023-02-15 00:56:59,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 00:56:59,921 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:56:59,921 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:56:59,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-15 00:57:00,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:57:00,130 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2023-02-15 00:57:00,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:00,130 INFO L85 PathProgramCache]: Analyzing trace with hash 179688781, now seen corresponding path program 1 times [2023-02-15 00:57:00,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:00,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440254968] [2023-02-15 00:57:00,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:57:00,131 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:57:00,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:00,132 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 00:57:00,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 00:57:00,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:57:00,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 00:57:00,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:57:00,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:57:00,198 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:57:00,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:57:00,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440254968] [2023-02-15 00:57:00,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440254968] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:57:00,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:57:00,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 00:57:00,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093420649] [2023-02-15 00:57:00,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:57:00,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 00:57:00,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:57:00,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 00:57:00,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 00:57:00,200 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:00,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:57:00,247 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2023-02-15 00:57:00,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 00:57:00,247 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-15 00:57:00,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:57:00,248 INFO L225 Difference]: With dead ends: 64 [2023-02-15 00:57:00,248 INFO L226 Difference]: Without dead ends: 64 [2023-02-15 00:57:00,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 00:57:00,249 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 105 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 00:57:00,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 77 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 00:57:00,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-02-15 00:57:00,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 31. [2023-02-15 00:57:00,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 30 states have internal predecessors, (34), 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) [2023-02-15 00:57:00,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2023-02-15 00:57:00,252 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 8 [2023-02-15 00:57:00,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:57:00,253 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2023-02-15 00:57:00,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:00,253 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2023-02-15 00:57:00,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 00:57:00,253 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:57:00,253 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:57:00,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 00:57:00,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:57:00,460 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2023-02-15 00:57:00,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:00,461 INFO L85 PathProgramCache]: Analyzing trace with hash 179690703, now seen corresponding path program 1 times [2023-02-15 00:57:00,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:00,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116539439] [2023-02-15 00:57:00,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:57:00,462 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:57:00,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:00,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 00:57:00,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 00:57:00,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:57:00,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 00:57:00,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:57:00,575 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 00:57:00,576 INFO L350 Elim1Store]: Elim1 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 1 case distinctions, treesize of input 9 treesize of output 19 [2023-02-15 00:57:00,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:57:00,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:57:00,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:57:00,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2116539439] [2023-02-15 00:57:00,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2116539439] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:57:00,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:57:00,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 00:57:00,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132371442] [2023-02-15 00:57:00,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:57:00,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 00:57:00,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:57:00,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 00:57:00,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 00:57:00,589 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:00,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:57:00,640 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2023-02-15 00:57:00,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 00:57:00,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-15 00:57:00,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:57:00,641 INFO L225 Difference]: With dead ends: 38 [2023-02-15 00:57:00,641 INFO L226 Difference]: Without dead ends: 38 [2023-02-15 00:57:00,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 00:57:00,642 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 36 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 00:57:00,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 44 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 00:57:00,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-15 00:57:00,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2023-02-15 00:57:00,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 28 states have internal predecessors, (32), 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) [2023-02-15 00:57:00,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2023-02-15 00:57:00,645 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 8 [2023-02-15 00:57:00,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:57:00,645 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2023-02-15 00:57:00,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:00,645 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2023-02-15 00:57:00,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 00:57:00,646 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:57:00,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:57:00,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-02-15 00:57:00,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:57:00,855 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2023-02-15 00:57:00,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:00,855 INFO L85 PathProgramCache]: Analyzing trace with hash 179690704, now seen corresponding path program 1 times [2023-02-15 00:57:00,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:00,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164329825] [2023-02-15 00:57:00,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:57:00,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:57:00,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:00,857 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 00:57:00,857 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 00:57:00,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:57:00,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 00:57:00,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:57:00,924 INFO L350 Elim1Store]: Elim1 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 8 treesize of output 7 [2023-02-15 00:57:00,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:57:00,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:57:00,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:57:00,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [164329825] [2023-02-15 00:57:00,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [164329825] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:57:00,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:57:00,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 00:57:00,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328306593] [2023-02-15 00:57:00,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:57:00,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 00:57:00,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:57:00,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 00:57:00,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 00:57:00,953 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:01,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:57:01,057 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2023-02-15 00:57:01,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 00:57:01,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-15 00:57:01,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:57:01,058 INFO L225 Difference]: With dead ends: 58 [2023-02-15 00:57:01,058 INFO L226 Difference]: Without dead ends: 58 [2023-02-15 00:57:01,058 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-15 00:57:01,058 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 70 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 00:57:01,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 85 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 00:57:01,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-02-15 00:57:01,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 35. [2023-02-15 00:57:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 34 states have internal predecessors, (40), 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) [2023-02-15 00:57:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2023-02-15 00:57:01,061 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 8 [2023-02-15 00:57:01,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:57:01,061 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2023-02-15 00:57:01,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:01,061 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2023-02-15 00:57:01,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 00:57:01,062 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:57:01,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:57:01,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-15 00:57:01,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:57:01,269 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2023-02-15 00:57:01,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:01,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1274213166, now seen corresponding path program 1 times [2023-02-15 00:57:01,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:01,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346638480] [2023-02-15 00:57:01,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:57:01,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:57:01,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:01,270 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 00:57:01,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 00:57:01,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:57:01,303 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 00:57:01,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:57:01,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:57:01,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:57:01,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:57:01,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346638480] [2023-02-15 00:57:01,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346638480] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:57:01,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:57:01,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 00:57:01,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93862681] [2023-02-15 00:57:01,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:57:01,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 00:57:01,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:57:01,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 00:57:01,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 00:57:01,316 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:01,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:57:01,322 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2023-02-15 00:57:01,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 00:57:01,322 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-02-15 00:57:01,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:57:01,324 INFO L225 Difference]: With dead ends: 34 [2023-02-15 00:57:01,324 INFO L226 Difference]: Without dead ends: 34 [2023-02-15 00:57:01,324 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 00:57:01,324 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 19 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 00:57:01,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 26 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 00:57:01,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-02-15 00:57:01,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-02-15 00:57:01,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 33 states have internal predecessors, (39), 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) [2023-02-15 00:57:01,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2023-02-15 00:57:01,327 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 9 [2023-02-15 00:57:01,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:57:01,327 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2023-02-15 00:57:01,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:01,328 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2023-02-15 00:57:01,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 00:57:01,328 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:57:01,328 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:57:01,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-15 00:57:01,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:57:01,535 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2023-02-15 00:57:01,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:01,535 INFO L85 PathProgramCache]: Analyzing trace with hash 845902566, now seen corresponding path program 1 times [2023-02-15 00:57:01,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:01,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770885514] [2023-02-15 00:57:01,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:57:01,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:57:01,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:01,537 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 00:57:01,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-15 00:57:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:57:01,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2023-02-15 00:57:01,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:57:01,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:57:01,588 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:57:01,588 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:57:01,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770885514] [2023-02-15 00:57:01,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770885514] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:57:01,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:57:01,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 00:57:01,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849522557] [2023-02-15 00:57:01,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:57:01,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 00:57:01,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:57:01,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 00:57:01,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 00:57:01,590 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-02-15 00:57:01,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:57:01,602 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2023-02-15 00:57:01,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 00:57:01,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-15 00:57:01,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:57:01,603 INFO L225 Difference]: With dead ends: 33 [2023-02-15 00:57:01,603 INFO L226 Difference]: Without dead ends: 33 [2023-02-15 00:57:01,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 00:57:01,604 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 00:57:01,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 18 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 00:57:01,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-02-15 00:57:01,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-02-15 00:57:01,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 32 states have internal predecessors, (38), 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) [2023-02-15 00:57:01,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2023-02-15 00:57:01,606 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 10 [2023-02-15 00:57:01,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:57:01,606 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2023-02-15 00:57:01,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2023-02-15 00:57:01,606 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2023-02-15 00:57:01,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 00:57:01,607 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:57:01,607 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:57:01,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-15 00:57:01,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:57:01,814 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2023-02-15 00:57:01,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:01,814 INFO L85 PathProgramCache]: Analyzing trace with hash 453175856, now seen corresponding path program 1 times [2023-02-15 00:57:01,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:01,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488756091] [2023-02-15 00:57:01,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:57:01,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:57:01,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:01,815 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 00:57:01,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-15 00:57:01,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:57:01,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 00:57:01,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:57:01,881 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-15 00:57:01,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:57:01,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:57:01,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:57:01,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488756091] [2023-02-15 00:57:01,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [488756091] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:57:01,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:57:01,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 00:57:01,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132940384] [2023-02-15 00:57:01,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:57:01,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 00:57:01,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:57:01,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 00:57:01,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 00:57:01,900 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:01,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:57:01,917 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2023-02-15 00:57:01,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 00:57:01,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-15 00:57:01,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:57:01,918 INFO L225 Difference]: With dead ends: 38 [2023-02-15 00:57:01,918 INFO L226 Difference]: Without dead ends: 38 [2023-02-15 00:57:01,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 00:57:01,918 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 1 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 00:57:01,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 36 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 00:57:01,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-02-15 00:57:01,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2023-02-15 00:57:01,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 states have internal predecessors, (43), 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) [2023-02-15 00:57:01,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2023-02-15 00:57:01,921 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 11 [2023-02-15 00:57:01,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:57:01,921 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2023-02-15 00:57:01,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:01,921 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2023-02-15 00:57:01,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 00:57:01,922 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:57:01,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:57:01,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-15 00:57:02,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:57:02,128 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2023-02-15 00:57:02,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:02,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1163549737, now seen corresponding path program 1 times [2023-02-15 00:57:02,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:02,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1944617911] [2023-02-15 00:57:02,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:57:02,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:57:02,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:02,130 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 00:57:02,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-15 00:57:02,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:57:02,163 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 00:57:02,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:57:02,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:57:02,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:57:02,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:57:02,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1944617911] [2023-02-15 00:57:02,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1944617911] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:57:02,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:57:02,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 00:57:02,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426478936] [2023-02-15 00:57:02,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:57:02,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 00:57:02,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:57:02,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 00:57:02,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 00:57:02,186 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2023-02-15 00:57:02,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:57:02,210 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2023-02-15 00:57:02,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 00:57:02,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 00:57:02,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:57:02,213 INFO L225 Difference]: With dead ends: 32 [2023-02-15 00:57:02,213 INFO L226 Difference]: Without dead ends: 32 [2023-02-15 00:57:02,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-02-15 00:57:02,213 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 00:57:02,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 42 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 00:57:02,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-02-15 00:57:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2023-02-15 00:57:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 31 states have internal predecessors, (36), 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) [2023-02-15 00:57:02,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2023-02-15 00:57:02,215 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 12 [2023-02-15 00:57:02,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:57:02,215 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2023-02-15 00:57:02,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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) [2023-02-15 00:57:02,216 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2023-02-15 00:57:02,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 00:57:02,216 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:57:02,216 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:57:02,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-02-15 00:57:02,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:57:02,425 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2023-02-15 00:57:02,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:02,425 INFO L85 PathProgramCache]: Analyzing trace with hash 702945990, now seen corresponding path program 1 times [2023-02-15 00:57:02,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:02,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959659259] [2023-02-15 00:57:02,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:57:02,426 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:57:02,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:02,426 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 00:57:02,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-15 00:57:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:57:02,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 00:57:02,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:57:02,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:57:02,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:57:02,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:57:02,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959659259] [2023-02-15 00:57:02,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959659259] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:57:02,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:57:02,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 00:57:02,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837334967] [2023-02-15 00:57:02,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:57:02,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 00:57:02,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:57:02,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 00:57:02,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-02-15 00:57:02,609 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2023-02-15 00:57:02,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:57:02,665 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2023-02-15 00:57:02,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 00:57:02,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-15 00:57:02,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:57:02,666 INFO L225 Difference]: With dead ends: 31 [2023-02-15 00:57:02,666 INFO L226 Difference]: Without dead ends: 31 [2023-02-15 00:57:02,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2023-02-15 00:57:02,666 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 00:57:02,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 17 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 00:57:02,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-02-15 00:57:02,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-02-15 00:57:02,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:02,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-02-15 00:57:02,668 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 13 [2023-02-15 00:57:02,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:57:02,668 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-02-15 00:57:02,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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) [2023-02-15 00:57:02,668 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-02-15 00:57:02,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 00:57:02,669 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:57:02,669 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:57:02,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-15 00:57:02,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:57:02,869 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2023-02-15 00:57:02,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:02,870 INFO L85 PathProgramCache]: Analyzing trace with hash 702991736, now seen corresponding path program 1 times [2023-02-15 00:57:02,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:02,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1209702436] [2023-02-15 00:57:02,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:57:02,870 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:57:02,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:02,871 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 00:57:02,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-15 00:57:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:57:02,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 00:57:02,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:57:02,950 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:57:02,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:57:02,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:57:02,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1209702436] [2023-02-15 00:57:02,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1209702436] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:57:02,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:57:02,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 00:57:02,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117996405] [2023-02-15 00:57:02,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:57:02,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 00:57:02,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:57:02,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 00:57:02,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 00:57:02,952 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) [2023-02-15 00:57:03,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:57:03,019 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2023-02-15 00:57:03,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 00:57:03,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-15 00:57:03,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:57:03,020 INFO L225 Difference]: With dead ends: 41 [2023-02-15 00:57:03,020 INFO L226 Difference]: Without dead ends: 41 [2023-02-15 00:57:03,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-15 00:57:03,021 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 70 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 00:57:03,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 51 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 00:57:03,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-02-15 00:57:03,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2023-02-15 00:57:03,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 30 states have internal predecessors, (32), 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) [2023-02-15 00:57:03,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2023-02-15 00:57:03,022 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 13 [2023-02-15 00:57:03,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:57:03,023 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2023-02-15 00:57:03,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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) [2023-02-15 00:57:03,023 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2023-02-15 00:57:03,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 00:57:03,023 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:57:03,023 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:57:03,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-02-15 00:57:03,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:57:03,223 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2023-02-15 00:57:03,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:03,224 INFO L85 PathProgramCache]: Analyzing trace with hash 702993658, now seen corresponding path program 1 times [2023-02-15 00:57:03,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:03,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126402351] [2023-02-15 00:57:03,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:57:03,224 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:57:03,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:03,225 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 00:57:03,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-15 00:57:03,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:57:03,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 00:57:03,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:57:03,329 INFO L350 Elim1Store]: Elim1 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 8 treesize of output 7 [2023-02-15 00:57:03,358 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:57:03,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:57:03,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:57:03,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:57:03,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126402351] [2023-02-15 00:57:03,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126402351] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:57:03,587 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 00:57:03,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-02-15 00:57:03,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910036786] [2023-02-15 00:57:03,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 00:57:03,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 00:57:03,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:57:03,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 00:57:03,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2023-02-15 00:57:03,588 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 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) [2023-02-15 00:57:04,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:57:04,779 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2023-02-15 00:57:04,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 00:57:04,780 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-15 00:57:04,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:57:04,780 INFO L225 Difference]: With dead ends: 112 [2023-02-15 00:57:04,780 INFO L226 Difference]: Without dead ends: 112 [2023-02-15 00:57:04,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2023-02-15 00:57:04,782 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 322 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 00:57:04,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 99 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 00:57:04,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-15 00:57:04,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 49. [2023-02-15 00:57:04,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 48 states have internal predecessors, (53), 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) [2023-02-15 00:57:04,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2023-02-15 00:57:04,797 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 13 [2023-02-15 00:57:04,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:57:04,797 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2023-02-15 00:57:04,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.090909090909091) internal successors, (23), 12 states have internal predecessors, (23), 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) [2023-02-15 00:57:04,797 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2023-02-15 00:57:04,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 00:57:04,798 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:57:04,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:57:04,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-15 00:57:04,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:57:05,000 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 6 more)] === [2023-02-15 00:57:05,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:05,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1949553038, now seen corresponding path program 1 times [2023-02-15 00:57:05,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:05,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [209292081] [2023-02-15 00:57:05,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:57:05,000 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:57:05,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:05,001 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 00:57:05,002 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-15 00:57:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 00:57:05,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-02-15 00:57:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-02-15 00:57:05,107 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-02-15 00:57:05,107 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-02-15 00:57:05,108 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE (8 of 9 remaining) [2023-02-15 00:57:05,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 9 remaining) [2023-02-15 00:57:05,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2023-02-15 00:57:05,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (5 of 9 remaining) [2023-02-15 00:57:05,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (4 of 9 remaining) [2023-02-15 00:57:05,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (3 of 9 remaining) [2023-02-15 00:57:05,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE (2 of 9 remaining) [2023-02-15 00:57:05,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE (1 of 9 remaining) [2023-02-15 00:57:05,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (0 of 9 remaining) [2023-02-15 00:57:05,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-15 00:57:05,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:57:05,312 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:57:05,315 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-02-15 00:57:05,320 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,321 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,321 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,321 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,321 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,321 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,322 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,322 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,322 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,322 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,322 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,322 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,323 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,323 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,323 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,323 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,323 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,323 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,324 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,324 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,324 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,324 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,324 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,324 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,325 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,325 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,325 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,325 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,325 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,325 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,325 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,326 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,326 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,326 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,326 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,326 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,326 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,326 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,327 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,327 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,327 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,327 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,327 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,327 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,328 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,328 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,328 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,328 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,328 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,328 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,329 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,329 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,329 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,329 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,329 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,329 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,329 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,330 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 12:57:05 BoogieIcfgContainer [2023-02-15 00:57:05,351 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-02-15 00:57:05,352 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-02-15 00:57:05,352 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-02-15 00:57:05,352 INFO L275 PluginConnector]: Witness Printer initialized [2023-02-15 00:57:05,352 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:56:58" (3/4) ... [2023-02-15 00:57:05,353 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-02-15 00:57:05,355 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,355 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,355 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,355 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,355 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,355 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,355 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,355 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,355 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,355 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,355 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,356 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,356 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,356 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,356 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,356 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,356 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,356 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,356 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,356 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,356 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,356 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,356 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,356 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,356 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,356 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,356 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,356 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,357 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,357 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,357 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,357 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,357 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,357 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,357 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,357 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,357 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,357 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,357 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,357 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,357 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,357 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,358 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,358 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,358 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,358 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,358 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,358 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,358 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,358 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,364 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,364 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,364 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,364 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,364 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,364 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,364 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled [2023-02-15 00:57:05,364 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled [2023-02-15 00:57:05,391 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-02-15 00:57:05,391 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-02-15 00:57:05,392 INFO L158 Benchmark]: Toolchain (without parser) took 7261.03ms. Allocated memory is still 115.3MB. Free memory was 91.3MB in the beginning and 39.4MB in the end (delta: 51.9MB). Peak memory consumption was 51.8MB. Max. memory is 16.1GB. [2023-02-15 00:57:05,392 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 71.3MB. Free memory was 48.4MB in the beginning and 48.3MB in the end (delta: 85.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 00:57:05,392 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.32ms. Allocated memory is still 115.3MB. Free memory was 91.0MB in the beginning and 70.9MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-02-15 00:57:05,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.82ms. Allocated memory is still 115.3MB. Free memory was 70.9MB in the beginning and 69.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 00:57:05,393 INFO L158 Benchmark]: Boogie Preprocessor took 35.66ms. Allocated memory is still 115.3MB. Free memory was 68.8MB in the beginning and 67.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 00:57:05,393 INFO L158 Benchmark]: RCFGBuilder took 380.54ms. Allocated memory is still 115.3MB. Free memory was 67.4MB in the beginning and 88.0MB in the end (delta: -20.6MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2023-02-15 00:57:05,393 INFO L158 Benchmark]: TraceAbstraction took 6405.80ms. Allocated memory is still 115.3MB. Free memory was 87.5MB in the beginning and 44.7MB in the end (delta: 42.8MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2023-02-15 00:57:05,393 INFO L158 Benchmark]: Witness Printer took 39.53ms. Allocated memory is still 115.3MB. Free memory was 44.7MB in the beginning and 39.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-02-15 00:57:05,394 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 71.3MB. Free memory was 48.4MB in the beginning and 48.3MB in the end (delta: 85.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.32ms. Allocated memory is still 115.3MB. Free memory was 91.0MB in the beginning and 70.9MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.82ms. Allocated memory is still 115.3MB. Free memory was 70.9MB in the beginning and 69.1MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.66ms. Allocated memory is still 115.3MB. Free memory was 68.8MB in the beginning and 67.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 380.54ms. Allocated memory is still 115.3MB. Free memory was 67.4MB in the beginning and 88.0MB in the end (delta: -20.6MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6405.80ms. Allocated memory is still 115.3MB. Free memory was 87.5MB in the beginning and 44.7MB in the end (delta: 42.8MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. * Witness Printer took 39.53ms. Allocated memory is still 115.3MB. Free memory was 44.7MB in the beginning and 39.4MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_realloc_ptr#1 : $Pointer$ not handled * 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 - CounterExampleResult [Line: 538]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L512] int num; [L513] int ind, newsize, i = 1; VAL [i=1, ind=0, newsize=0, num=0] [L528] num = __VERIFIER_nondet_int() [L529] COND FALSE !(!(num > 0 && num < 100)) [L532] int *a = (int *)malloc(sizeof(int)); [L533] COND FALSE !(a == ((void *)0)) [L536] newsize = 0 [L537] CALL expandArray(a) [L515] int *a = (int *)arg; [L516] int *b = ((void *)0); VAL [a={1:0}, arg={1:0}, arg={1:0}, b={0:0}, i=1, ind=0, newsize=0, num=1] [L517] COND TRUE newsize < num [L518] newsize = newsize + 1 [L519] EXPR, FCALL realloc(a, sizeof(int) * newsize) [L519] b = realloc(a, sizeof(int) * newsize) [L520] b[newsize - 1] = i VAL [a={1:0}, arg={1:0}, arg={1:0}, b={1:0}, i=1, ind=0, newsize=1, num=1] [L521] a = b VAL [a={1:0}, arg={1:0}, arg={1:0}, b={1:0}, i=1, ind=0, newsize=1, num=1] [L517] COND FALSE !(newsize < num) VAL [a={1:0}, arg={1:0}, arg={1:0}, b={1:0}, i=1, ind=0, newsize=1, num=1] [L523] COND TRUE b != ((void *)0) VAL [a={1:0}, arg={1:0}, arg={1:0}, b={1:0}, i=1, ind=0, newsize=1, num=1] [L524] free(b) VAL [a={1:0}, arg={1:0}, arg={1:0}, b={1:0}, i=1, ind=0, newsize=1, num=1] [L524] free(b) VAL [a={1:0}, arg={1:0}, arg={1:0}, b={1:0}, i=1, ind=0, newsize=1, num=1] [L524] free(b) [L525] return 0; VAL [\result={0:0}, a={1:0}, arg={1:0}, arg={1:0}, b={1:0}, i=1, ind=0, newsize=1, num=1] [L537] RET expandArray(a) [L538] free(a) VAL [\old(argc)=5, a={1:0}, argc=5, argv={7:6}, argv={7:6}, i=1, ind=0, newsize=1, num=1] [L538] free(a) VAL [\old(argc)=5, a={1:0}, argc=5, argv={7:6}, argv={7:6}, i=1, ind=0, newsize=1, num=1] [L538] free(a) VAL [\old(argc)=5, a={1:0}, argc=5, argv={7:6}, argv={7:6}, i=1, ind=0, newsize=1, num=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 524]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 524]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 524]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 538]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 527]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 9 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 738 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 738 mSDsluCounter, 617 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 300 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 413 IncrementalHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 317 mSDtfsCounter, 413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 144 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=13, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 150 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 140 NumberOfCodeBlocks, 140 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 120 ConstructedInterpolants, 10 QuantifiedInterpolants, 564 SizeOfPredicates, 21 NumberOfNonLiveVariables, 711 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 5/13 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-02-15 00:57:05,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free)