./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test6_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test6_3.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 --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 8767e0bad2c10bf5e26ce466e806335c672949ef870a6e01ac396a8c6ce00fcd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 14:47:05,166 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:47:05,237 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 14:47:05,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:47:05,245 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:47:05,281 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:47:05,282 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:47:05,282 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:47:05,283 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 14:47:05,283 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 14:47:05,283 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:47:05,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:47:05,285 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:47:05,288 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:47:05,288 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:47:05,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:47:05,289 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 14:47:05,289 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:47:05,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 14:47:05,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:47:05,290 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 14:47:05,291 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 14:47:05,291 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 14:47:05,294 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:47:05,294 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 14:47:05,295 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:47:05,295 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:47:05,295 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 14:47:05,295 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:47:05,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:47:05,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:47:05,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 14:47:05,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:47:05,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:47:05,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:47:05,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:47:05,297 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 14:47:05,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 14:47:05,298 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:47:05,298 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:47:05,298 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:47:05,298 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:47:05,299 INFO L153 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 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 -> 8767e0bad2c10bf5e26ce466e806335c672949ef870a6e01ac396a8c6ce00fcd [2024-11-20 14:47:05,579 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:47:05,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:47:05,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:47:05,609 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:47:05,610 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:47:05,611 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test6_3.i [2024-11-20 14:47:07,102 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:47:07,339 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:47:07,340 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test6_3.i [2024-11-20 14:47:07,354 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beea48ac5/8d0d32451c0c44aab44cbe4f850a75fb/FLAG36aa22ecf [2024-11-20 14:47:07,369 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/beea48ac5/8d0d32451c0c44aab44cbe4f850a75fb [2024-11-20 14:47:07,371 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:47:07,372 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:47:07,373 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:47:07,373 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:47:07,378 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:47:07,379 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:47:07" (1/1) ... [2024-11-20 14:47:07,380 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e01d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:47:07, skipping insertion in model container [2024-11-20 14:47:07,380 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:47:07" (1/1) ... [2024-11-20 14:47:07,429 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:47:07,740 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:47:07,793 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:47:07,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:47:07,822 ERROR L321 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) [2024-11-20 14:47:07,823 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7833eaac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:47:07, skipping insertion in model container [2024-11-20 14:47:07,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:47:07,823 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-20 14:47:07,825 INFO L158 Benchmark]: Toolchain (without parser) took 451.98ms. Allocated memory is still 148.9MB. Free memory was 117.8MB in the beginning and 101.8MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 14:47:07,826 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 14:47:07,827 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.22ms. Allocated memory is still 148.9MB. Free memory was 117.8MB in the beginning and 101.8MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 14:47:07,828 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 109.1MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 450.22ms. Allocated memory is still 148.9MB. Free memory was 117.8MB in the beginning and 101.8MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: 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: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test6_3.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 --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 8767e0bad2c10bf5e26ce466e806335c672949ef870a6e01ac396a8c6ce00fcd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 14:47:09,896 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:47:09,983 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-20 14:47:09,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:47:09,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:47:10,025 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:47:10,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:47:10,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:47:10,029 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 14:47:10,030 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 14:47:10,030 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:47:10,031 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:47:10,032 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:47:10,033 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:47:10,034 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:47:10,034 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:47:10,035 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 14:47:10,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:47:10,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 14:47:10,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:47:10,036 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 14:47:10,040 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 14:47:10,040 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 14:47:10,040 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:47:10,041 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 14:47:10,041 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 14:47:10,041 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:47:10,041 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 14:47:10,042 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:47:10,042 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 14:47:10,042 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:47:10,043 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:47:10,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:47:10,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 14:47:10,045 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:47:10,045 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:47:10,046 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:47:10,046 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:47:10,046 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 14:47:10,046 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 14:47:10,047 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:47:10,047 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:47:10,047 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:47:10,047 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:47:10,048 INFO L153 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 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 -> 8767e0bad2c10bf5e26ce466e806335c672949ef870a6e01ac396a8c6ce00fcd [2024-11-20 14:47:10,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:47:10,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:47:10,455 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:47:10,457 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:47:10,457 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:47:10,458 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test6_3.i [2024-11-20 14:47:12,007 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:47:12,258 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:47:12,259 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test6_3.i [2024-11-20 14:47:12,276 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b142003c4/52e76e1812634cd8b6f406d0ac3c3197/FLAG068a9cd93 [2024-11-20 14:47:12,293 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b142003c4/52e76e1812634cd8b6f406d0ac3c3197 [2024-11-20 14:47:12,303 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:47:12,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:47:12,306 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:47:12,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:47:12,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:47:12,314 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:47:12" (1/1) ... [2024-11-20 14:47:12,315 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cdb18aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:47:12, skipping insertion in model container [2024-11-20 14:47:12,315 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:47:12" (1/1) ... [2024-11-20 14:47:12,364 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:47:12,729 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:47:12,803 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:47:12,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:47:12,841 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-20 14:47:12,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:47:12,885 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:47:12,907 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:47:12,909 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:47:12,923 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 14:47:12,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:47:13,019 INFO L204 MainTranslator]: Completed translation [2024-11-20 14:47:13,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:47:13 WrapperNode [2024-11-20 14:47:13,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:47:13,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 14:47:13,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 14:47:13,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 14:47:13,028 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:47:13" (1/1) ... [2024-11-20 14:47:13,059 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:47:13" (1/1) ... [2024-11-20 14:47:13,084 INFO L138 Inliner]: procedures = 169, calls = 77, calls flagged for inlining = 25, calls inlined = 7, statements flattened = 58 [2024-11-20 14:47:13,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 14:47:13,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 14:47:13,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 14:47:13,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 14:47:13,096 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:47:13" (1/1) ... [2024-11-20 14:47:13,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:47:13" (1/1) ... [2024-11-20 14:47:13,099 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:47:13" (1/1) ... [2024-11-20 14:47:13,112 INFO L175 MemorySlicer]: Split 5 memory accesses to 3 slices as follows [2, 0, 3]. 60 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 2 writes are split as follows [0, 0, 2]. [2024-11-20 14:47:13,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:47:13" (1/1) ... [2024-11-20 14:47:13,113 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:47:13" (1/1) ... [2024-11-20 14:47:13,119 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:47:13" (1/1) ... [2024-11-20 14:47:13,121 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:47:13" (1/1) ... [2024-11-20 14:47:13,123 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:47:13" (1/1) ... [2024-11-20 14:47:13,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:47:13" (1/1) ... [2024-11-20 14:47:13,133 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 14:47:13,134 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 14:47:13,135 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 14:47:13,135 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 14:47:13,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:47:13" (1/1) ... [2024-11-20 14:47:13,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:47:13,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:47:13,165 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 14:47:13,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 14:47:13,206 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-20 14:47:13,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-20 14:47:13,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 14:47:13,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 14:47:13,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 14:47:13,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 14:47:13,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-20 14:47:13,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 14:47:13,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-20 14:47:13,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-20 14:47:13,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-20 14:47:13,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 14:47:13,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 14:47:13,334 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 14:47:13,336 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 14:47:13,594 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-20 14:47:13,594 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 14:47:13,609 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 14:47:13,609 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 14:47:13,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:47:13 BoogieIcfgContainer [2024-11-20 14:47:13,610 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 14:47:13,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 14:47:13,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 14:47:13,616 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 14:47:13,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:47:12" (1/3) ... [2024-11-20 14:47:13,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3134a255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:47:13, skipping insertion in model container [2024-11-20 14:47:13,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:47:13" (2/3) ... [2024-11-20 14:47:13,617 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3134a255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:47:13, skipping insertion in model container [2024-11-20 14:47:13,617 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:47:13" (3/3) ... [2024-11-20 14:47:13,619 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test6_3.i [2024-11-20 14:47:13,637 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 14:47:13,637 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-11-20 14:47:13,680 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:47:13,689 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@6c1cc98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:47:13,689 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2024-11-20 14:47:13,694 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 23 states have (on average 1.565217391304348) internal successors, (36), 31 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:13,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 14:47:13,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:47:13,703 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:47:13,704 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2024-11-20 14:47:13,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:47:13,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1378433930, now seen corresponding path program 1 times [2024-11-20 14:47:13,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:47:13,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306067736] [2024-11-20 14:47:13,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:47:13,722 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 [2024-11-20 14:47:13,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:47:13,726 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) [2024-11-20 14:47:13,727 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 [2024-11-20 14:47:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:47:13,806 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 14:47:13,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:47:13,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:47:13,882 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:47:13,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:47:13,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306067736] [2024-11-20 14:47:13,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306067736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:47:13,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:47:13,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:47:13,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241085573] [2024-11-20 14:47:13,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:47:13,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:47:13,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:47:13,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:47:13,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:47:13,941 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.565217391304348) internal successors, (36), 31 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:14,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:47:14,010 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2024-11-20 14:47:14,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:47:14,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-20 14:47:14,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:47:14,022 INFO L225 Difference]: With dead ends: 49 [2024-11-20 14:47:14,023 INFO L226 Difference]: Without dead ends: 47 [2024-11-20 14:47:14,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:47:14,031 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 12 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:47:14,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 117 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:47:14,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-20 14:47:14,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2024-11-20 14:47:14,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.48) internal successors, (37), 32 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 14:47:14,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2024-11-20 14:47:14,068 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 12 [2024-11-20 14:47:14,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:47:14,069 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2024-11-20 14:47:14,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2024-11-20 14:47:14,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 14:47:14,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:47:14,071 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:47:14,076 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 [2024-11-20 14:47:14,274 WARN L453 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 [2024-11-20 14:47:14,275 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2024-11-20 14:47:14,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:47:14,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1378399289, now seen corresponding path program 1 times [2024-11-20 14:47:14,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:47:14,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [9536998] [2024-11-20 14:47:14,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:47:14,276 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 [2024-11-20 14:47:14,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:47:14,278 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) [2024-11-20 14:47:14,293 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 [2024-11-20 14:47:14,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:47:14,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 14:47:14,369 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:47:14,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:47:14,416 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:47:14,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:47:14,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [9536998] [2024-11-20 14:47:14,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [9536998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:47:14,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:47:14,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:47:14,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239182574] [2024-11-20 14:47:14,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:47:14,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:47:14,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:47:14,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:47:14,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:47:14,419 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:14,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:47:14,458 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2024-11-20 14:47:14,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:47:14,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-20 14:47:14,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:47:14,460 INFO L225 Difference]: With dead ends: 35 [2024-11-20 14:47:14,460 INFO L226 Difference]: Without dead ends: 35 [2024-11-20 14:47:14,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:47:14,462 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:47:14,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 104 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:47:14,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-20 14:47:14,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-20 14:47:14,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 25 states have (on average 1.44) internal successors, (36), 31 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 14:47:14,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-11-20 14:47:14,467 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 12 [2024-11-20 14:47:14,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:47:14,467 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-20 14:47:14,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:14,467 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-20 14:47:14,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 14:47:14,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:47:14,468 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:47:14,472 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 [2024-11-20 14:47:14,669 WARN L453 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 [2024-11-20 14:47:14,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2024-11-20 14:47:14,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:47:14,670 INFO L85 PathProgramCache]: Analyzing trace with hash 364376405, now seen corresponding path program 1 times [2024-11-20 14:47:14,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:47:14,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138744380] [2024-11-20 14:47:14,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:47:14,671 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 [2024-11-20 14:47:14,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:47:14,673 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) [2024-11-20 14:47:14,674 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 [2024-11-20 14:47:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:47:14,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 14:47:14,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:47:14,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:47:14,891 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:47:14,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:47:14,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138744380] [2024-11-20 14:47:14,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138744380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:47:14,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:47:14,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:47:14,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965775122] [2024-11-20 14:47:14,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:47:14,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:47:14,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:47:14,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:47:14,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:47:14,894 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:14,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:47:14,989 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2024-11-20 14:47:14,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:47:14,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-20 14:47:14,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:47:14,992 INFO L225 Difference]: With dead ends: 43 [2024-11-20 14:47:14,992 INFO L226 Difference]: Without dead ends: 43 [2024-11-20 14:47:14,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:47:14,994 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:47:14,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 49 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:47:14,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-20 14:47:15,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2024-11-20 14:47:15,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 29 states have (on average 1.4482758620689655) internal successors, (42), 35 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 14:47:15,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2024-11-20 14:47:15,005 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 12 [2024-11-20 14:47:15,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:47:15,006 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2024-11-20 14:47:15,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:15,007 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2024-11-20 14:47:15,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 14:47:15,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:47:15,008 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:47:15,012 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 [2024-11-20 14:47:15,209 WARN L453 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 [2024-11-20 14:47:15,210 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2024-11-20 14:47:15,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:47:15,211 INFO L85 PathProgramCache]: Analyzing trace with hash 364376406, now seen corresponding path program 1 times [2024-11-20 14:47:15,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:47:15,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924744167] [2024-11-20 14:47:15,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:47:15,211 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 [2024-11-20 14:47:15,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:47:15,214 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) [2024-11-20 14:47:15,215 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 [2024-11-20 14:47:15,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:47:15,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 14:47:15,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:47:15,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:47:15,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:47:15,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:47:15,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924744167] [2024-11-20 14:47:15,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924744167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:47:15,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:47:15,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:47:15,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108405470] [2024-11-20 14:47:15,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:47:15,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:47:15,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:47:15,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:47:15,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:47:15,438 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:15,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:47:15,538 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2024-11-20 14:47:15,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:47:15,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-20 14:47:15,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:47:15,541 INFO L225 Difference]: With dead ends: 64 [2024-11-20 14:47:15,541 INFO L226 Difference]: Without dead ends: 64 [2024-11-20 14:47:15,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:47:15,542 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 26 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:47:15,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 105 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:47:15,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-20 14:47:15,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2024-11-20 14:47:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 52 states have internal predecessors, (68), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 14:47:15,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2024-11-20 14:47:15,555 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 12 [2024-11-20 14:47:15,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:47:15,556 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2024-11-20 14:47:15,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:15,556 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2024-11-20 14:47:15,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 14:47:15,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:47:15,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:47:15,561 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 (5)] Ended with exit code 0 [2024-11-20 14:47:15,757 WARN L453 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 [2024-11-20 14:47:15,757 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2024-11-20 14:47:15,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:47:15,758 INFO L85 PathProgramCache]: Analyzing trace with hash 219295069, now seen corresponding path program 1 times [2024-11-20 14:47:15,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:47:15,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1179597959] [2024-11-20 14:47:15,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:47:15,759 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 [2024-11-20 14:47:15,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:47:15,761 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) [2024-11-20 14:47:15,763 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 [2024-11-20 14:47:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:47:15,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 14:47:15,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:47:15,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:47:15,898 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:47:15,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:47:15,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1179597959] [2024-11-20 14:47:15,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1179597959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:47:15,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:47:15,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:47:15,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793393999] [2024-11-20 14:47:15,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:47:15,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:47:15,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:47:15,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:47:15,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:47:15,900 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:15,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:47:15,965 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2024-11-20 14:47:15,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:47:15,966 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-20 14:47:15,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:47:15,967 INFO L225 Difference]: With dead ends: 58 [2024-11-20 14:47:15,968 INFO L226 Difference]: Without dead ends: 58 [2024-11-20 14:47:15,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:47:15,969 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 47 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:47:15,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 93 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:47:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-20 14:47:15,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-11-20 14:47:15,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 52 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 14:47:15,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2024-11-20 14:47:15,978 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 13 [2024-11-20 14:47:15,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:47:15,982 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2024-11-20 14:47:15,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:15,982 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2024-11-20 14:47:15,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 14:47:15,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:47:15,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:47:15,988 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 [2024-11-20 14:47:16,183 WARN L453 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 [2024-11-20 14:47:16,184 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2024-11-20 14:47:16,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:47:16,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1588159394, now seen corresponding path program 1 times [2024-11-20 14:47:16,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:47:16,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1535353454] [2024-11-20 14:47:16,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:47:16,185 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 [2024-11-20 14:47:16,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:47:16,187 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) [2024-11-20 14:47:16,189 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 [2024-11-20 14:47:16,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:47:16,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 14:47:16,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:47:16,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:47:16,302 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:47:16,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:47:16,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1535353454] [2024-11-20 14:47:16,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1535353454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:47:16,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:47:16,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:47:16,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832841281] [2024-11-20 14:47:16,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:47:16,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:47:16,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:47:16,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:47:16,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:47:16,305 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:16,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:47:16,343 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2024-11-20 14:47:16,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:47:16,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-20 14:47:16,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:47:16,345 INFO L225 Difference]: With dead ends: 42 [2024-11-20 14:47:16,345 INFO L226 Difference]: Without dead ends: 42 [2024-11-20 14:47:16,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:47:16,346 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:47:16,346 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:47:16,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-20 14:47:16,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-20 14:47:16,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 38 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 14:47:16,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-11-20 14:47:16,353 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 13 [2024-11-20 14:47:16,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:47:16,353 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-11-20 14:47:16,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:16,356 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-11-20 14:47:16,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 14:47:16,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:47:16,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:47:16,361 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 (7)] Ended with exit code 0 [2024-11-20 14:47:16,557 WARN L453 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 [2024-11-20 14:47:16,558 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2024-11-20 14:47:16,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:47:16,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1791787383, now seen corresponding path program 1 times [2024-11-20 14:47:16,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:47:16,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642322910] [2024-11-20 14:47:16,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:47:16,560 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 [2024-11-20 14:47:16,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:47:16,563 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) [2024-11-20 14:47:16,564 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 [2024-11-20 14:47:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:47:16,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 14:47:16,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:47:16,632 INFO L378 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 [2024-11-20 14:47:16,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:47:16,668 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:47:16,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:47:16,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642322910] [2024-11-20 14:47:16,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642322910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:47:16,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:47:16,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:47:16,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254924858] [2024-11-20 14:47:16,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:47:16,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:47:16,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:47:16,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:47:16,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:47:16,670 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:16,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:47:16,718 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-11-20 14:47:16,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:47:16,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-20 14:47:16,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:47:16,719 INFO L225 Difference]: With dead ends: 41 [2024-11-20 14:47:16,719 INFO L226 Difference]: Without dead ends: 41 [2024-11-20 14:47:16,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:47:16,720 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:47:16,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 76 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:47:16,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-20 14:47:16,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-20 14:47:16,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 37 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 14:47:16,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-20 14:47:16,723 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 14 [2024-11-20 14:47:16,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:47:16,724 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-20 14:47:16,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:16,724 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-20 14:47:16,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 14:47:16,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:47:16,724 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:47:16,731 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 [2024-11-20 14:47:16,927 WARN L453 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 [2024-11-20 14:47:16,927 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2024-11-20 14:47:16,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:47:16,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1791739619, now seen corresponding path program 1 times [2024-11-20 14:47:16,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:47:16,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51634185] [2024-11-20 14:47:16,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:47:16,929 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 [2024-11-20 14:47:16,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:47:16,932 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) [2024-11-20 14:47:16,934 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 [2024-11-20 14:47:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:47:16,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-20 14:47:16,992 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:47:17,100 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-20 14:47:17,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:47:17,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 14:47:17,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:47:17,204 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:47:17,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:47:17,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51634185] [2024-11-20 14:47:17,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51634185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:47:17,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:47:17,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:47:17,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070671140] [2024-11-20 14:47:17,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:47:17,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 14:47:17,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:47:17,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 14:47:17,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2024-11-20 14:47:17,206 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:17,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:47:17,384 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-11-20 14:47:17,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:47:17,384 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-20 14:47:17,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:47:17,385 INFO L225 Difference]: With dead ends: 42 [2024-11-20 14:47:17,385 INFO L226 Difference]: Without dead ends: 42 [2024-11-20 14:47:17,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=51, Unknown=1, NotChecked=14, Total=90 [2024-11-20 14:47:17,386 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 45 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:47:17,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 54 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 37 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2024-11-20 14:47:17,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-20 14:47:17,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2024-11-20 14:47:17,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 31 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-20 14:47:17,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2024-11-20 14:47:17,390 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 14 [2024-11-20 14:47:17,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:47:17,390 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2024-11-20 14:47:17,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:17,391 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2024-11-20 14:47:17,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 14:47:17,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:47:17,391 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:47:17,395 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 (9)] Ended with exit code 0 [2024-11-20 14:47:17,594 WARN L453 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 [2024-11-20 14:47:17,594 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2024-11-20 14:47:17,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:47:17,595 INFO L85 PathProgramCache]: Analyzing trace with hash -2021592266, now seen corresponding path program 1 times [2024-11-20 14:47:17,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:47:17,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [43371024] [2024-11-20 14:47:17,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:47:17,595 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 [2024-11-20 14:47:17,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:47:17,596 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) [2024-11-20 14:47:17,597 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 [2024-11-20 14:47:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:47:17,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 14:47:17,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:47:17,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:47:17,673 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:47:17,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:47:17,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [43371024] [2024-11-20 14:47:17,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [43371024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:47:17,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:47:17,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:47:17,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655482054] [2024-11-20 14:47:17,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:47:17,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:47:17,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:47:17,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:47:17,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:47:17,675 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:17,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:47:17,720 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2024-11-20 14:47:17,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:47:17,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2024-11-20 14:47:17,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:47:17,721 INFO L225 Difference]: With dead ends: 41 [2024-11-20 14:47:17,721 INFO L226 Difference]: Without dead ends: 31 [2024-11-20 14:47:17,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:47:17,722 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:47:17,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 73 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:47:17,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-20 14:47:17,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-20 14:47:17,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 28 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:17,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2024-11-20 14:47:17,725 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 14 [2024-11-20 14:47:17,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:47:17,725 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2024-11-20 14:47:17,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:17,725 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2024-11-20 14:47:17,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 14:47:17,726 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:47:17,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:47:17,731 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 (10)] Ended with exit code 0 [2024-11-20 14:47:17,926 WARN L453 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 [2024-11-20 14:47:17,926 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2024-11-20 14:47:17,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:47:17,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1284300541, now seen corresponding path program 1 times [2024-11-20 14:47:17,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:47:17,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294971514] [2024-11-20 14:47:17,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:47:17,927 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 [2024-11-20 14:47:17,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:47:17,928 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) [2024-11-20 14:47:17,929 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 [2024-11-20 14:47:17,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:47:17,980 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 14:47:17,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:47:18,090 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-20 14:47:18,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-20 14:47:18,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2024-11-20 14:47:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:47:18,225 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:47:18,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:47:18,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294971514] [2024-11-20 14:47:18,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [294971514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:47:18,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:47:18,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:47:18,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698471952] [2024-11-20 14:47:18,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:47:18,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 14:47:18,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:47:18,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 14:47:18,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:47:18,227 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:18,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:47:18,336 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-20 14:47:18,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:47:18,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-20 14:47:18,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:47:18,338 INFO L225 Difference]: With dead ends: 30 [2024-11-20 14:47:18,338 INFO L226 Difference]: Without dead ends: 30 [2024-11-20 14:47:18,338 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 14:47:18,339 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 15 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:47:18,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 61 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:47:18,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-20 14:47:18,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-20 14:47:18,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:18,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-20 14:47:18,344 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 17 [2024-11-20 14:47:18,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:47:18,344 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-20 14:47:18,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:18,344 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-20 14:47:18,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 14:47:18,345 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:47:18,345 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:47:18,350 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 [2024-11-20 14:47:18,548 WARN L453 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 [2024-11-20 14:47:18,549 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2024-11-20 14:47:18,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:47:18,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1284300540, now seen corresponding path program 1 times [2024-11-20 14:47:18,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:47:18,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1276613608] [2024-11-20 14:47:18,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:47:18,550 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 [2024-11-20 14:47:18,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:47:18,551 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) [2024-11-20 14:47:18,552 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 [2024-11-20 14:47:18,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:47:18,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 14:47:18,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:47:18,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:47:18,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 14:47:18,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:47:18,889 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:47:18,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:47:18,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1276613608] [2024-11-20 14:47:18,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1276613608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:47:18,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:47:18,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:47:18,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080400735] [2024-11-20 14:47:18,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:47:18,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:47:18,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:47:18,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:47:18,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:47:18,891 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:19,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:47:19,379 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2024-11-20 14:47:19,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:47:19,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2024-11-20 14:47:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:47:19,380 INFO L225 Difference]: With dead ends: 29 [2024-11-20 14:47:19,380 INFO L226 Difference]: Without dead ends: 29 [2024-11-20 14:47:19,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:47:19,381 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 14:47:19,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 63 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 14:47:19,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-20 14:47:19,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2024-11-20 14:47:19,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:19,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2024-11-20 14:47:19,384 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 17 [2024-11-20 14:47:19,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:47:19,384 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2024-11-20 14:47:19,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:19,384 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2024-11-20 14:47:19,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 14:47:19,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:47:19,385 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:47:19,389 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 (12)] Ended with exit code 0 [2024-11-20 14:47:19,585 WARN L453 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 [2024-11-20 14:47:19,586 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2024-11-20 14:47:19,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:47:19,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1557205148, now seen corresponding path program 1 times [2024-11-20 14:47:19,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:47:19,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379853054] [2024-11-20 14:47:19,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:47:19,587 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 [2024-11-20 14:47:19,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:47:19,589 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) [2024-11-20 14:47:19,590 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 [2024-11-20 14:47:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:47:19,650 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-20 14:47:19,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:47:19,814 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_probe1_6_~p~0#1.base_13| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_probe1_6_~p~0#1.base_13|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_probe1_6_~p~0#1.base_13| (_ bv0 1))))) is different from true [2024-11-20 14:47:19,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:47:19,847 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:47:19,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:47:19,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379853054] [2024-11-20 14:47:19,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [379853054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:47:19,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:47:19,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 14:47:19,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978778340] [2024-11-20 14:47:19,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:47:19,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:47:19,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:47:19,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:47:19,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=32, Unknown=1, NotChecked=10, Total=56 [2024-11-20 14:47:19,849 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:19,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:47:19,999 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2024-11-20 14:47:20,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 14:47:20,000 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2024-11-20 14:47:20,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:47:20,001 INFO L225 Difference]: With dead ends: 34 [2024-11-20 14:47:20,001 INFO L226 Difference]: Without dead ends: 22 [2024-11-20 14:47:20,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=43, Unknown=1, NotChecked=12, Total=72 [2024-11-20 14:47:20,002 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:47:20,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 83 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 30 Unchecked, 0.1s Time] [2024-11-20 14:47:20,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-20 14:47:20,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-20 14:47:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:20,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2024-11-20 14:47:20,004 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2024-11-20 14:47:20,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:47:20,005 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2024-11-20 14:47:20,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:20,005 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2024-11-20 14:47:20,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-20 14:47:20,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:47:20,005 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:47:20,009 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 (13)] Forceful destruction successful, exit code 0 [2024-11-20 14:47:20,206 WARN L453 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 [2024-11-20 14:47:20,206 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2024-11-20 14:47:20,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:47:20,207 INFO L85 PathProgramCache]: Analyzing trace with hash -261845752, now seen corresponding path program 1 times [2024-11-20 14:47:20,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:47:20,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749855374] [2024-11-20 14:47:20,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:47:20,207 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 [2024-11-20 14:47:20,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:47:20,211 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) [2024-11-20 14:47:20,212 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 [2024-11-20 14:47:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:47:20,278 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 14:47:20,279 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:47:20,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:47:20,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:47:20,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:47:20,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749855374] [2024-11-20 14:47:20,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [749855374] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:47:20,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:47:20,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:47:20,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608485013] [2024-11-20 14:47:20,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:47:20,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:47:20,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:47:20,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:47:20,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:47:20,297 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:20,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:47:20,309 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2024-11-20 14:47:20,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:47:20,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-20 14:47:20,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:47:20,310 INFO L225 Difference]: With dead ends: 22 [2024-11-20 14:47:20,310 INFO L226 Difference]: Without dead ends: 22 [2024-11-20 14:47:20,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:47:20,311 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:47:20,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:47:20,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-20 14:47:20,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-11-20 14:47:20,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:20,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2024-11-20 14:47:20,313 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 20 [2024-11-20 14:47:20,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:47:20,313 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2024-11-20 14:47:20,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 14:47:20,314 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2024-11-20 14:47:20,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-20 14:47:20,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:47:20,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:47:20,318 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 (14)] Ended with exit code 0 [2024-11-20 14:47:20,515 WARN L453 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 [2024-11-20 14:47:20,515 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 5 more)] === [2024-11-20 14:47:20,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:47:20,515 INFO L85 PathProgramCache]: Analyzing trace with hash 468899183, now seen corresponding path program 1 times [2024-11-20 14:47:20,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:47:20,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760134033] [2024-11-20 14:47:20,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:47:20,516 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 [2024-11-20 14:47:20,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:47:20,517 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) [2024-11-20 14:47:20,519 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 [2024-11-20 14:47:20,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:47:20,591 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 14:47:20,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 14:47:20,650 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-20 14:47:20,650 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 14:47:20,651 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2024-11-20 14:47:20,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 8 remaining) [2024-11-20 14:47:20,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2024-11-20 14:47:20,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (4 of 8 remaining) [2024-11-20 14:47:20,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE (3 of 8 remaining) [2024-11-20 14:47:20,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE (2 of 8 remaining) [2024-11-20 14:47:20,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 8 remaining) [2024-11-20 14:47:20,653 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 8 remaining) [2024-11-20 14:47:20,662 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 [2024-11-20 14:47:20,853 WARN L453 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 [2024-11-20 14:47:20,857 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:47:20,887 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 14:47:20,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:47:20 BoogieIcfgContainer [2024-11-20 14:47:20,891 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 14:47:20,891 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 14:47:20,891 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 14:47:20,892 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 14:47:20,892 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:47:13" (3/4) ... [2024-11-20 14:47:20,894 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 14:47:20,896 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 14:47:20,896 INFO L158 Benchmark]: Toolchain (without parser) took 8591.71ms. Allocated memory was 69.2MB in the beginning and 100.7MB in the end (delta: 31.5MB). Free memory was 50.4MB in the beginning and 59.2MB in the end (delta: -8.8MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2024-11-20 14:47:20,896 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 50.3MB. Free memory is still 33.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 14:47:20,897 INFO L158 Benchmark]: CACSL2BoogieTranslator took 714.53ms. Allocated memory is still 69.2MB. Free memory was 50.1MB in the beginning and 39.2MB in the end (delta: 10.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-20 14:47:20,897 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.39ms. Allocated memory is still 69.2MB. Free memory was 39.2MB in the beginning and 36.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 14:47:20,898 INFO L158 Benchmark]: Boogie Preprocessor took 47.85ms. Allocated memory is still 69.2MB. Free memory was 36.8MB in the beginning and 34.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 14:47:20,898 INFO L158 Benchmark]: RCFGBuilder took 475.72ms. Allocated memory is still 69.2MB. Free memory was 34.4MB in the beginning and 40.8MB in the end (delta: -6.3MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-11-20 14:47:20,898 INFO L158 Benchmark]: TraceAbstraction took 7279.02ms. Allocated memory was 69.2MB in the beginning and 100.7MB in the end (delta: 31.5MB). Free memory was 40.0MB in the beginning and 59.2MB in the end (delta: -19.2MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2024-11-20 14:47:20,898 INFO L158 Benchmark]: Witness Printer took 4.47ms. Allocated memory is still 100.7MB. Free memory is still 59.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 14:47:20,899 INFO L338 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 50.3MB. Free memory is still 33.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 714.53ms. Allocated memory is still 69.2MB. Free memory was 50.1MB in the beginning and 39.2MB in the end (delta: 10.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.39ms. Allocated memory is still 69.2MB. Free memory was 39.2MB in the beginning and 36.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.85ms. Allocated memory is still 69.2MB. Free memory was 36.8MB in the beginning and 34.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 475.72ms. Allocated memory is still 69.2MB. Free memory was 34.4MB in the beginning and 40.8MB in the end (delta: -6.3MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7279.02ms. Allocated memory was 69.2MB in the beginning and 100.7MB in the end (delta: 31.5MB). Free memory was 40.0MB in the beginning and 59.2MB in the end (delta: -19.2MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Witness Printer took 4.47ms. Allocated memory is still 100.7MB. Free memory is still 59.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 790]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 790. Possible FailurePath: [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L569] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; [L782] struct A a6; [L782] struct A a6; VAL [a6={2:0}, ldv_global_msg_list={1:0}] [L791] CALL entry_point() [L784] CALL, EXPR probe1_6(&a6) [L764] int ret = - -3; VAL [a6={2:0}, a={2:0}, ldv_global_msg_list={1:0}, ret=3] [L765] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(size)=4, a6={2:0}, ldv_global_msg_list={1:0}] [L526] COND TRUE __VERIFIER_nondet_int() [L527] return malloc(size); [L765] RET, EXPR ldv_malloc(sizeof(int)) VAL [a6={2:0}, a={2:0}, ldv_global_msg_list={1:0}, ret=3] [L765] int *p = (int *)ldv_malloc(sizeof(int)); [L766] COND FALSE !(p==0) [L768] CALL, EXPR f6() [L758] return __VERIFIER_nondet_int(); [L768] RET, EXPR f6() [L768] ret = f6() [L769] COND FALSE !(ret<0) [L771] CALL, EXPR g6() [L761] return __VERIFIER_nondet_int(); [L771] RET, EXPR g6() [L771] ret = g6() [L772] COND FALSE !(ret<0) VAL [a6={2:0}, a={2:0}, ldv_global_msg_list={1:0}, p={6:0}] [L774] a->p = p VAL [a6={2:0}, ldv_global_msg_list={1:0}] [L775] return 0; VAL [\result=0, a6={2:0}, ldv_global_msg_list={1:0}] [L784] RET, EXPR probe1_6(&a6) [L784] int ret = probe1_6(&a6); [L785] COND TRUE ret==0 [L786] FCALL disconnect_2_6(&a6) [L788] a6.p = 0 VAL [a6={2:0}, ldv_global_msg_list={1:0}] [L791] RET entry_point() - 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: 777]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that free always succeeds Unable to prove that free 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 7.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 220 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 220 mSDsluCounter, 1055 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 69 IncrementalHoareTripleChecker+Unchecked, 701 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 453 IncrementalHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 354 mSDtfsCounter, 453 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 186 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=4, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 36 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 176 ConstructedInterpolants, 9 QuantifiedInterpolants, 1319 SizeOfPredicates, 4 NumberOfNonLiveVariables, 712 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 14:47:20,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample