./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 27e059eb1633b1ab9c045484375455e2667fa3360a55d0bc53eccfa53fe7600f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:28:32,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:28:32,452 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-12 13:28:32,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:28:32,456 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:28:32,479 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:28:32,480 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:28:32,480 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:28:32,480 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:28:32,482 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:28:32,482 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:28:32,482 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:28:32,483 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:28:32,483 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:28:32,484 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:28:32,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:28:32,485 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:28:32,485 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:28:32,485 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:28:32,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:28:32,486 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:28:32,486 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:28:32,486 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:28:32,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:28:32,487 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:28:32,487 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:28:32,487 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:28:32,487 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:28:32,487 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:28:32,488 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:28:32,488 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:28:32,488 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:28:32,488 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:28:32,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:28:32,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:28:32,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:28:32,489 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:28:32,489 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:28:32,489 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:28:32,489 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:28:32,490 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:28:32,490 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:28:32,490 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 -> 27e059eb1633b1ab9c045484375455e2667fa3360a55d0bc53eccfa53fe7600f [2024-11-12 13:28:32,686 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:28:32,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:28:32,704 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:28:32,705 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:28:32,705 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:28:32,706 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2024-11-12 13:28:33,858 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:28:34,093 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:28:34,093 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2024-11-12 13:28:34,109 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2c52c1b0/700ac540847e4fd0960b7bd198e33d5c/FLAG280e49f59 [2024-11-12 13:28:34,453 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2c52c1b0/700ac540847e4fd0960b7bd198e33d5c [2024-11-12 13:28:34,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:28:34,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:28:34,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:28:34,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:28:34,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:28:34,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:28:34" (1/1) ... [2024-11-12 13:28:34,464 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4abe32b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:34, skipping insertion in model container [2024-11-12 13:28:34,464 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:28:34" (1/1) ... [2024-11-12 13:28:34,502 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:28:34,760 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-12 13:28:34,794 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-12 13:28:34,794 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-12 13:28:34,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:28:34,811 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-12 13:28:34,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@84ad3da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:34, skipping insertion in model container [2024-11-12 13:28:34,812 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:28:34,812 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-12 13:28:34,814 INFO L158 Benchmark]: Toolchain (without parser) took 357.69ms. Allocated memory is still 205.5MB. Free memory was 171.6MB in the beginning and 155.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 13:28:34,814 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 121.6MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 13:28:34,814 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.14ms. Allocated memory is still 205.5MB. Free memory was 171.6MB in the beginning and 155.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 13:28:34,815 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.12ms. Allocated memory is still 121.6MB. Free memory is still 82.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.14ms. Allocated memory is still 205.5MB. Free memory was 171.6MB in the beginning and 155.4MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 27e059eb1633b1ab9c045484375455e2667fa3360a55d0bc53eccfa53fe7600f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:28:36,296 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:28:36,352 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-12 13:28:36,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:28:36,356 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:28:36,380 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:28:36,380 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:28:36,381 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:28:36,381 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:28:36,382 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:28:36,382 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:28:36,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:28:36,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:28:36,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:28:36,385 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:28:36,385 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:28:36,385 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:28:36,385 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:28:36,385 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:28:36,386 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:28:36,386 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:28:36,388 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:28:36,388 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-12 13:28:36,389 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:28:36,389 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:28:36,389 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 13:28:36,389 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:28:36,389 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 13:28:36,390 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:28:36,390 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:28:36,390 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:28:36,391 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:28:36,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:28:36,391 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:28:36,391 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:28:36,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:28:36,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:28:36,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:28:36,392 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 13:28:36,392 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 13:28:36,392 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:28:36,393 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:28:36,393 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:28:36,393 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:28:36,393 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 -> 27e059eb1633b1ab9c045484375455e2667fa3360a55d0bc53eccfa53fe7600f [2024-11-12 13:28:36,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:28:36,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:28:36,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:28:36,664 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:28:36,665 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:28:36,665 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2024-11-12 13:28:37,984 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:28:38,179 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:28:38,180 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test18_2.i [2024-11-12 13:28:38,195 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/554b62c6b/be201f5cbed043b8aa8052a351ce27c9/FLAGa547fca93 [2024-11-12 13:28:38,536 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/554b62c6b/be201f5cbed043b8aa8052a351ce27c9 [2024-11-12 13:28:38,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:28:38,538 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:28:38,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:28:38,543 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:28:38,546 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:28:38,547 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:28:38" (1/1) ... [2024-11-12 13:28:38,547 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69682643 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:38, skipping insertion in model container [2024-11-12 13:28:38,547 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:28:38" (1/1) ... [2024-11-12 13:28:38,578 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:28:38,853 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-12 13:28:38,900 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-12 13:28:38,905 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-12 13:28:38,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:28:38,928 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-12 13:28:38,934 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:28:38,962 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-12 13:28:38,983 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-12 13:28:38,984 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-12 13:28:38,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:28:38,993 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:28:39,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:28:39,086 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:28:39,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:39 WrapperNode [2024-11-12 13:28:39,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:28:39,087 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:28:39,087 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:28:39,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:28:39,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:39" (1/1) ... [2024-11-12 13:28:39,119 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:39" (1/1) ... [2024-11-12 13:28:39,138 INFO L138 Inliner]: procedures = 165, calls = 73, calls flagged for inlining = 21, calls inlined = 3, statements flattened = 53 [2024-11-12 13:28:39,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:28:39,139 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:28:39,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:28:39,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:28:39,147 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:39" (1/1) ... [2024-11-12 13:28:39,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:39" (1/1) ... [2024-11-12 13:28:39,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:39" (1/1) ... [2024-11-12 13:28:39,163 INFO L175 MemorySlicer]: Split 4 memory accesses to 2 slices as follows [2, 2]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2024-11-12 13:28:39,163 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:39" (1/1) ... [2024-11-12 13:28:39,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:39" (1/1) ... [2024-11-12 13:28:39,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:39" (1/1) ... [2024-11-12 13:28:39,177 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:39" (1/1) ... [2024-11-12 13:28:39,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:39" (1/1) ... [2024-11-12 13:28:39,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:39" (1/1) ... [2024-11-12 13:28:39,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:28:39,184 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:28:39,184 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:28:39,185 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:28:39,185 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:39" (1/1) ... [2024-11-12 13:28:39,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:28:39,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:28:39,219 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-12 13:28:39,222 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-12 13:28:39,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-12 13:28:39,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-12 13:28:39,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:28:39,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:28:39,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 13:28:39,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 13:28:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 13:28:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 13:28:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:28:39,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-12 13:28:39,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-12 13:28:39,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:28:39,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:28:39,368 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:28:39,371 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:28:39,541 INFO L? ?]: Removed 30 outVars from TransFormulas that were not future-live. [2024-11-12 13:28:39,543 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:28:39,552 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:28:39,553 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 13:28:39,553 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:28:39 BoogieIcfgContainer [2024-11-12 13:28:39,555 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:28:39,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:28:39,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:28:39,558 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:28:39,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:28:38" (1/3) ... [2024-11-12 13:28:39,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55087d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:28:39, skipping insertion in model container [2024-11-12 13:28:39,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:28:39" (2/3) ... [2024-11-12 13:28:39,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55087d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:28:39, skipping insertion in model container [2024-11-12 13:28:39,560 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:28:39" (3/3) ... [2024-11-12 13:28:39,560 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test18_2.i [2024-11-12 13:28:39,573 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:28:39,573 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-11-12 13:28:39,609 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:28:39,616 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;@460c80af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:28:39,617 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-12 13:28:39,621 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.72) internal successors, (43), 36 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:28:39,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:28:39,625 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:39,625 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:39,625 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-12 13:28:39,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:39,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1121226903, now seen corresponding path program 1 times [2024-11-12 13:28:39,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:39,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971150255] [2024-11-12 13:28:39,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:39,639 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-12 13:28:39,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:39,642 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-12 13:28:39,643 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-12 13:28:39,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:39,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 13:28:39,718 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:39,766 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-12 13:28:39,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:28:39,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:39,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971150255] [2024-11-12 13:28:39,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971150255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:28:39,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:28:39,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:28:39,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404635841] [2024-11-12 13:28:39,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:28:39,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:28:39,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:39,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:28:39,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:28:39,799 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.72) internal successors, (43), 36 states have internal predecessors, (43), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:28:39,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:39,897 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2024-11-12 13:28:39,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:28:39,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-12 13:28:39,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:39,905 INFO L225 Difference]: With dead ends: 65 [2024-11-12 13:28:39,905 INFO L226 Difference]: Without dead ends: 63 [2024-11-12 13:28:39,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-12 13:28:39,908 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 22 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:39,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 208 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:28:39,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-12 13:28:39,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 42. [2024-11-12 13:28:39,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 37 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 13:28:39,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-11-12 13:28:39,940 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 11 [2024-11-12 13:28:39,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:39,941 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-11-12 13:28:39,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:28:39,941 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-11-12 13:28:39,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:28:39,943 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:39,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:39,950 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-12 13:28:40,148 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-12 13:28:40,149 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-12 13:28:40,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:40,150 INFO L85 PathProgramCache]: Analyzing trace with hash 2008730584, now seen corresponding path program 1 times [2024-11-12 13:28:40,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:40,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1391195985] [2024-11-12 13:28:40,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:40,151 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-12 13:28:40,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:40,154 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-12 13:28:40,154 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-12 13:28:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:40,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 13:28:40,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:40,248 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-12 13:28:40,249 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:28:40,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:40,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1391195985] [2024-11-12 13:28:40,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1391195985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:28:40,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:28:40,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:28:40,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812704738] [2024-11-12 13:28:40,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:28:40,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:28:40,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:40,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:28:40,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:28:40,253 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:28:40,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:40,328 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2024-11-12 13:28:40,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:28:40,329 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-11-12 13:28:40,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:40,330 INFO L225 Difference]: With dead ends: 69 [2024-11-12 13:28:40,330 INFO L226 Difference]: Without dead ends: 67 [2024-11-12 13:28:40,331 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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-12 13:28:40,331 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 26 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:40,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 145 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:28:40,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-12 13:28:40,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 48. [2024-11-12 13:28:40,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.53125) internal successors, (49), 42 states have internal predecessors, (49), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 13:28:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2024-11-12 13:28:40,341 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 11 [2024-11-12 13:28:40,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:40,342 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-11-12 13:28:40,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:28:40,342 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2024-11-12 13:28:40,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 13:28:40,343 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:40,344 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:40,346 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 (3)] Ended with exit code 0 [2024-11-12 13:28:40,546 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-12 13:28:40,546 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-12 13:28:40,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:40,547 INFO L85 PathProgramCache]: Analyzing trace with hash 398308128, now seen corresponding path program 1 times [2024-11-12 13:28:40,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:40,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446339435] [2024-11-12 13:28:40,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:40,548 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-12 13:28:40,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:40,550 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-12 13:28:40,551 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-12 13:28:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:40,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 13:28:40,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:40,614 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-12 13:28:40,615 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:28:40,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:40,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446339435] [2024-11-12 13:28:40,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [446339435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:28:40,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:28:40,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:28:40,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376819096] [2024-11-12 13:28:40,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:28:40,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:28:40,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:40,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:28:40,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:28:40,617 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:28:40,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:40,649 INFO L93 Difference]: Finished difference Result 63 states and 82 transitions. [2024-11-12 13:28:40,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:28:40,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-12 13:28:40,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:40,651 INFO L225 Difference]: With dead ends: 63 [2024-11-12 13:28:40,651 INFO L226 Difference]: Without dead ends: 63 [2024-11-12 13:28:40,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:28:40,653 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 42 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:40,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 67 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:28:40,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-12 13:28:40,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 49. [2024-11-12 13:28:40,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.5151515151515151) internal successors, (50), 43 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-12 13:28:40,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2024-11-12 13:28:40,664 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 12 [2024-11-12 13:28:40,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:40,664 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2024-11-12 13:28:40,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 13:28:40,664 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2024-11-12 13:28:40,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 13:28:40,665 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:40,665 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:40,670 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-12 13:28:40,865 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-12 13:28:40,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-12 13:28:40,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:40,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1387011810, now seen corresponding path program 1 times [2024-11-12 13:28:40,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:40,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135881372] [2024-11-12 13:28:40,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:40,867 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-12 13:28:40,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:40,869 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-12 13:28:40,870 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-12 13:28:40,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:40,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 13:28:40,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:40,950 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-12 13:28:41,080 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-12 13:28:41,080 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-12 13:28:41,094 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:28:41,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:28:49,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:28:49,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:49,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2135881372] [2024-11-12 13:28:49,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2135881372] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:28:49,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:28:49,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-12 13:28:49,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372512237] [2024-11-12 13:28:49,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:28:49,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 13:28:49,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:28:49,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 13:28:49,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=50, Unknown=2, NotChecked=0, Total=72 [2024-11-12 13:28:49,367 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:28:49,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:28:49,557 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2024-11-12 13:28:49,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:28:49,558 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 18 [2024-11-12 13:28:49,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:28:49,559 INFO L225 Difference]: With dead ends: 65 [2024-11-12 13:28:49,560 INFO L226 Difference]: Without dead ends: 65 [2024-11-12 13:28:49,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=26, Invalid=62, Unknown=2, NotChecked=0, Total=90 [2024-11-12 13:28:49,561 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:28:49,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 125 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:28:49,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-12 13:28:49,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2024-11-12 13:28:49,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 55 states have internal predecessors, (71), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (8), 6 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-12 13:28:49,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2024-11-12 13:28:49,571 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 18 [2024-11-12 13:28:49,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:28:49,571 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2024-11-12 13:28:49,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:28:49,574 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2024-11-12 13:28:49,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 13:28:49,575 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:28:49,575 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:28:49,579 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-12 13:28:49,775 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-12 13:28:49,776 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-12 13:28:49,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:28:49,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1387011811, now seen corresponding path program 1 times [2024-11-12 13:28:49,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:28:49,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1392923184] [2024-11-12 13:28:49,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:49,777 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-12 13:28:49,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:28:49,778 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-12 13:28:49,779 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-12 13:28:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:49,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-12 13:28:49,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:49,848 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 5 [2024-11-12 13:28:49,856 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-12 13:28:50,008 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-12 13:28:50,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:28:50,052 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-12 13:28:50,067 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:28:50,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:28:50,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-12 13:28:50,108 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:28:58,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:28:58,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1392923184] [2024-11-12 13:28:58,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1392923184] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:28:58,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1160476809] [2024-11-12 13:28:58,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:28:58,333 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 13:28:58,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 13:28:58,335 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 13:28:58,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-12 13:28:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:28:58,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-12 13:28:58,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:28:58,436 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 5 [2024-11-12 13:28:58,441 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-12 13:28:58,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:28:58,551 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-12 13:28:58,565 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:28:58,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:28:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-12 13:28:58,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:02,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1160476809] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:02,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:02,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-12 13:29:02,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325286576] [2024-11-12 13:29:02,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:02,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:29:02,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:02,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:29:02,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=86, Unknown=3, NotChecked=18, Total=132 [2024-11-12 13:29:02,769 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand has 10 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:29:03,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:03,113 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2024-11-12 13:29:03,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:29:03,114 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-11-12 13:29:03,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:03,116 INFO L225 Difference]: With dead ends: 74 [2024-11-12 13:29:03,116 INFO L226 Difference]: Without dead ends: 74 [2024-11-12 13:29:03,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=49, Invalid=192, Unknown=3, NotChecked=28, Total=272 [2024-11-12 13:29:03,117 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 46 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 61 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:03,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 172 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 178 Invalid, 0 Unknown, 61 Unchecked, 0.2s Time] [2024-11-12 13:29:03,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-12 13:29:03,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2024-11-12 13:29:03,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 49 states have (on average 1.530612244897959) internal successors, (75), 58 states have internal predecessors, (75), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-12 13:29:03,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 90 transitions. [2024-11-12 13:29:03,127 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 90 transitions. Word has length 18 [2024-11-12 13:29:03,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:03,127 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 90 transitions. [2024-11-12 13:29:03,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 1.75) internal successors, (14), 9 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:29:03,127 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 90 transitions. [2024-11-12 13:29:03,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 13:29:03,128 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:03,128 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:03,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:03,331 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 (6)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:03,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-12 13:29:03,529 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-12 13:29:03,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:03,530 INFO L85 PathProgramCache]: Analyzing trace with hash 881453185, now seen corresponding path program 1 times [2024-11-12 13:29:03,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:03,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709814796] [2024-11-12 13:29:03,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:03,530 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-12 13:29:03,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:03,533 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-12 13:29:03,534 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-12 13:29:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:03,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 13:29:03,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:03,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:29:03,610 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:29:03,610 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:03,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709814796] [2024-11-12 13:29:03,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709814796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:29:03,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:29:03,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:29:03,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118929736] [2024-11-12 13:29:03,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:29:03,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:29:03,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:03,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:29:03,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:29:03,611 INFO L87 Difference]: Start difference. First operand 67 states and 90 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:29:03,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:03,665 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2024-11-12 13:29:03,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:29:03,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2024-11-12 13:29:03,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:03,667 INFO L225 Difference]: With dead ends: 51 [2024-11-12 13:29:03,667 INFO L226 Difference]: Without dead ends: 49 [2024-11-12 13:29:03,667 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-12 13:29:03,667 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:03,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:29:03,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-12 13:29:03,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-12 13:29:03,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 34 states have (on average 1.5294117647058822) internal successors, (52), 44 states have internal predecessors, (52), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-12 13:29:03,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2024-11-12 13:29:03,673 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 18 [2024-11-12 13:29:03,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:03,674 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2024-11-12 13:29:03,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:29:03,674 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2024-11-12 13:29:03,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 13:29:03,675 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:03,675 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:03,682 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 (8)] Ended with exit code 0 [2024-11-12 13:29:03,877 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-12 13:29:03,881 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-12 13:29:03,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:03,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1478437295, now seen corresponding path program 1 times [2024-11-12 13:29:03,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:03,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750785503] [2024-11-12 13:29:03,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:03,881 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-12 13:29:03,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:03,882 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-12 13:29:03,884 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-12 13:29:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:03,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 13:29:03,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:03,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:29:03,939 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:29:03,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:03,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750785503] [2024-11-12 13:29:03,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750785503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:29:03,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:29:03,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:29:03,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86434252] [2024-11-12 13:29:03,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:29:03,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:29:03,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:03,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:29:03,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:29:03,940 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 13:29:03,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:03,966 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2024-11-12 13:29:03,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:29:03,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2024-11-12 13:29:03,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:03,967 INFO L225 Difference]: With dead ends: 56 [2024-11-12 13:29:03,967 INFO L226 Difference]: Without dead ends: 56 [2024-11-12 13:29:03,967 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-12 13:29:03,967 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:03,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 144 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:29:03,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-12 13:29:03,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2024-11-12 13:29:03,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 46 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-12 13:29:03,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2024-11-12 13:29:03,971 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 20 [2024-11-12 13:29:03,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:03,971 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2024-11-12 13:29:03,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 13:29:03,971 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2024-11-12 13:29:03,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 13:29:03,971 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:03,972 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:03,974 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-12 13:29:04,175 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-12 13:29:04,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-12 13:29:04,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:04,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1073719666, now seen corresponding path program 1 times [2024-11-12 13:29:04,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:04,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1949558476] [2024-11-12 13:29:04,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:04,177 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-12 13:29:04,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:04,178 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-12 13:29:04,179 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-12 13:29:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:04,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 13:29:04,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:04,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:29:04,242 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:29:04,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:04,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1949558476] [2024-11-12 13:29:04,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1949558476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:29:04,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:29:04,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:29:04,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577261515] [2024-11-12 13:29:04,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:29:04,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:29:04,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:04,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:29:04,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:29:04,243 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:29:04,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:04,280 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2024-11-12 13:29:04,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:29:04,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-11-12 13:29:04,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:04,281 INFO L225 Difference]: With dead ends: 56 [2024-11-12 13:29:04,281 INFO L226 Difference]: Without dead ends: 56 [2024-11-12 13:29:04,281 INFO L434 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-12 13:29:04,282 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:04,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 95 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:29:04,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-12 13:29:04,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-11-12 13:29:04,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.45) internal successors, (58), 48 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-12 13:29:04,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2024-11-12 13:29:04,286 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 20 [2024-11-12 13:29:04,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:04,286 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2024-11-12 13:29:04,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:29:04,286 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2024-11-12 13:29:04,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 13:29:04,286 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:04,286 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:04,290 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-12 13:29:04,487 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-12 13:29:04,487 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-12 13:29:04,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:04,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1073719716, now seen corresponding path program 1 times [2024-11-12 13:29:04,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:04,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534320563] [2024-11-12 13:29:04,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:04,488 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-12 13:29:04,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:04,490 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-12 13:29:04,490 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-12 13:29:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:04,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 13:29:04,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:04,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:29:04,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:04,583 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:29:04,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:04,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534320563] [2024-11-12 13:29:04,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [534320563] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:04,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:04,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2024-11-12 13:29:04,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923760674] [2024-11-12 13:29:04,584 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:04,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:29:04,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:04,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:29:04,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:29:04,584 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:29:04,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:04,629 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2024-11-12 13:29:04,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:29:04,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2024-11-12 13:29:04,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:04,630 INFO L225 Difference]: With dead ends: 55 [2024-11-12 13:29:04,630 INFO L226 Difference]: Without dead ends: 55 [2024-11-12 13:29:04,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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-12 13:29:04,634 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 14 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:04,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 106 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:29:04,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-12 13:29:04,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2024-11-12 13:29:04,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 40 states have (on average 1.4) internal successors, (56), 47 states have internal predecessors, (56), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-12 13:29:04,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2024-11-12 13:29:04,637 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 20 [2024-11-12 13:29:04,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:04,638 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2024-11-12 13:29:04,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 13:29:04,641 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2024-11-12 13:29:04,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-12 13:29:04,641 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:04,641 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:04,646 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 (11)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:04,844 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-12 13:29:04,844 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-12 13:29:04,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:04,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1074427268, now seen corresponding path program 1 times [2024-11-12 13:29:04,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:04,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75558805] [2024-11-12 13:29:04,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:04,845 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-12 13:29:04,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:04,847 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-12 13:29:04,847 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-12 13:29:04,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:04,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 13:29:04,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:05,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:29:05,062 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:05,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:29:05,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:05,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75558805] [2024-11-12 13:29:05,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75558805] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:05,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:05,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 9 [2024-11-12 13:29:05,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605628425] [2024-11-12 13:29:05,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:05,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:29:05,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:05,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:29:05,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:29:05,148 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:05,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:05,284 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2024-11-12 13:29:05,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:29:05,284 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 21 [2024-11-12 13:29:05,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:05,285 INFO L225 Difference]: With dead ends: 58 [2024-11-12 13:29:05,285 INFO L226 Difference]: Without dead ends: 56 [2024-11-12 13:29:05,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-12 13:29:05,285 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 30 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:05,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 106 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:29:05,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-12 13:29:05,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-11-12 13:29:05,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 47 states have internal predecessors, (56), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-12 13:29:05,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2024-11-12 13:29:05,289 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 21 [2024-11-12 13:29:05,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:05,289 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2024-11-12 13:29:05,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:05,289 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2024-11-12 13:29:05,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-12 13:29:05,290 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:05,290 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:05,293 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-12 13:29:05,492 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-12 13:29:05,492 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-12 13:29:05,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:05,493 INFO L85 PathProgramCache]: Analyzing trace with hash -807401739, now seen corresponding path program 1 times [2024-11-12 13:29:05,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:05,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388738021] [2024-11-12 13:29:05,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:05,493 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-12 13:29:05,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:05,494 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-12 13:29:05,495 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-12 13:29:05,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:05,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 13:29:05,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:05,586 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:29:05,587 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:05,644 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:29:05,644 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:05,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388738021] [2024-11-12 13:29:05,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388738021] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:05,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:05,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-12 13:29:05,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874271466] [2024-11-12 13:29:05,644 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:05,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:29:05,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:05,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:29:05,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:29:05,645 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:05,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:05,740 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2024-11-12 13:29:05,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 13:29:05,740 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 22 [2024-11-12 13:29:05,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:05,741 INFO L225 Difference]: With dead ends: 76 [2024-11-12 13:29:05,741 INFO L226 Difference]: Without dead ends: 76 [2024-11-12 13:29:05,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:29:05,742 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 67 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:05,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 116 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:29:05,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-12 13:29:05,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2024-11-12 13:29:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 61 states have internal predecessors, (76), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (9), 9 states have call predecessors, (9), 5 states have call successors, (9) [2024-11-12 13:29:05,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 90 transitions. [2024-11-12 13:29:05,745 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 90 transitions. Word has length 22 [2024-11-12 13:29:05,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:05,745 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 90 transitions. [2024-11-12 13:29:05,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 8 states have internal predecessors, (24), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:05,745 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 90 transitions. [2024-11-12 13:29:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-12 13:29:05,745 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:05,746 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:05,751 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-12 13:29:05,946 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-12 13:29:05,946 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-12 13:29:05,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:05,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2128418719, now seen corresponding path program 1 times [2024-11-12 13:29:05,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:05,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838573893] [2024-11-12 13:29:05,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:05,947 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-12 13:29:05,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:05,948 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-12 13:29:05,949 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-12 13:29:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:05,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-12 13:29:05,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:06,101 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_~array~0#1.base_23| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~array~0#1.base_23| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~array~0#1.base_23|)))) is different from true [2024-11-12 13:29:06,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:29:06,107 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:06,192 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-11-12 13:29:06,193 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 43 treesize of output 38 [2024-11-12 13:29:06,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:06,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838573893] [2024-11-12 13:29:06,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838573893] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:06,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1088542608] [2024-11-12 13:29:06,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:06,339 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 13:29:06,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 13:29:06,342 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 13:29:06,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2024-11-12 13:29:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:06,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 13:29:06,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:06,607 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:29:06,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:06,692 INFO L349 Elim1Store]: treesize reduction 30, result has 21.1 percent of original size [2024-11-12 13:29:06,692 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 43 treesize of output 38 [2024-11-12 13:29:06,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1088542608] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:06,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:06,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2024-11-12 13:29:06,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236411924] [2024-11-12 13:29:06,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:06,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:29:06,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:06,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:29:06,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=106, Unknown=1, NotChecked=20, Total=156 [2024-11-12 13:29:06,790 INFO L87 Difference]: Start difference. First operand 73 states and 90 transitions. Second operand has 12 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:07,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:07,055 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2024-11-12 13:29:07,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 13:29:07,056 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 24 [2024-11-12 13:29:07,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:07,057 INFO L225 Difference]: With dead ends: 109 [2024-11-12 13:29:07,057 INFO L226 Difference]: Without dead ends: 102 [2024-11-12 13:29:07,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 65 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=221, Unknown=1, NotChecked=30, Total=306 [2024-11-12 13:29:07,058 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 60 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:07,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 171 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 157 Invalid, 0 Unknown, 66 Unchecked, 0.2s Time] [2024-11-12 13:29:07,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-12 13:29:07,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 94. [2024-11-12 13:29:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.3157894736842106) internal successors, (100), 79 states have internal predecessors, (100), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (15), 12 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-12 13:29:07,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 123 transitions. [2024-11-12 13:29:07,062 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 123 transitions. Word has length 24 [2024-11-12 13:29:07,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:07,062 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 123 transitions. [2024-11-12 13:29:07,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:07,062 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 123 transitions. [2024-11-12 13:29:07,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-12 13:29:07,063 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:07,063 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:07,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:07,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:07,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-12 13:29:07,464 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-12 13:29:07,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:07,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1844216072, now seen corresponding path program 1 times [2024-11-12 13:29:07,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:07,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971479360] [2024-11-12 13:29:07,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:07,465 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-12 13:29:07,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:07,466 INFO L229 MonitoredProcess]: Starting monitored process 16 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-12 13:29:07,467 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 (16)] Waiting until timeout for monitored process [2024-11-12 13:29:07,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:07,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-12 13:29:07,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:07,536 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 5 [2024-11-12 13:29:07,541 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-12 13:29:07,678 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-12 13:29:07,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:07,697 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-12 13:29:07,712 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:07,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:07,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:07,831 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-12 13:29:07,841 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:07,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-12 13:29:07,877 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:08,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:08,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971479360] [2024-11-12 13:29:08,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971479360] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:08,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [429625411] [2024-11-12 13:29:08,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:08,089 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 13:29:08,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 13:29:08,090 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 13:29:08,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2024-11-12 13:29:08,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:08,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-12 13:29:08,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:08,182 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 5 [2024-11-12 13:29:08,187 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-12 13:29:08,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:08,260 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-12 13:29:08,269 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:08,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:08,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:08,353 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-12 13:29:08,364 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:08,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:08,382 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2024-11-12 13:29:08,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:08,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [429625411] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:08,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:08,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2024-11-12 13:29:08,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236202497] [2024-11-12 13:29:08,544 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:08,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-12 13:29:08,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:08,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-12 13:29:08,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2024-11-12 13:29:08,545 INFO L87 Difference]: Start difference. First operand 94 states and 123 transitions. Second operand has 12 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:29:08,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:08,880 INFO L93 Difference]: Finished difference Result 98 states and 125 transitions. [2024-11-12 13:29:08,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 13:29:08,880 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2024-11-12 13:29:08,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:08,881 INFO L225 Difference]: With dead ends: 98 [2024-11-12 13:29:08,881 INFO L226 Difference]: Without dead ends: 98 [2024-11-12 13:29:08,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=70, Invalid=313, Unknown=1, NotChecked=36, Total=420 [2024-11-12 13:29:08,882 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 50 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:08,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 187 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 207 Invalid, 0 Unknown, 64 Unchecked, 0.2s Time] [2024-11-12 13:29:08,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-12 13:29:08,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2024-11-12 13:29:08,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 79 states have internal predecessors, (98), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (15), 12 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-12 13:29:08,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 121 transitions. [2024-11-12 13:29:08,885 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 121 transitions. Word has length 28 [2024-11-12 13:29:08,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:08,885 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 121 transitions. [2024-11-12 13:29:08,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 13:29:08,886 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 121 transitions. [2024-11-12 13:29:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-12 13:29:08,886 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:08,886 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:08,890 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 (16)] Ended with exit code 0 [2024-11-12 13:29:09,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:09,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-12 13:29:09,287 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-12 13:29:09,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:09,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1022360221, now seen corresponding path program 1 times [2024-11-12 13:29:09,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:09,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733973530] [2024-11-12 13:29:09,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:09,288 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-12 13:29:09,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:09,289 INFO L229 MonitoredProcess]: Starting monitored process 18 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-12 13:29:09,290 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 (18)] Waiting until timeout for monitored process [2024-11-12 13:29:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:09,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 13:29:09,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:09,467 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:29:09,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:09,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-12 13:29:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:29:09,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:09,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733973530] [2024-11-12 13:29:09,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733973530] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:09,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:09,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2024-11-12 13:29:09,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907863442] [2024-11-12 13:29:09,906 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:09,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-12 13:29:09,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:09,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-12 13:29:09,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-12 13:29:09,907 INFO L87 Difference]: Start difference. First operand 94 states and 121 transitions. Second operand has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-12 13:29:10,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:10,446 INFO L93 Difference]: Finished difference Result 122 states and 155 transitions. [2024-11-12 13:29:10,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-12 13:29:10,447 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 30 [2024-11-12 13:29:10,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:10,448 INFO L225 Difference]: With dead ends: 122 [2024-11-12 13:29:10,448 INFO L226 Difference]: Without dead ends: 122 [2024-11-12 13:29:10,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2024-11-12 13:29:10,449 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 29 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:10,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 217 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:29:10,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-12 13:29:10,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 94. [2024-11-12 13:29:10,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 79 states have internal predecessors, (97), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (15), 12 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-12 13:29:10,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 120 transitions. [2024-11-12 13:29:10,455 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 120 transitions. Word has length 30 [2024-11-12 13:29:10,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:10,458 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 120 transitions. [2024-11-12 13:29:10,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.7333333333333334) internal successors, (41), 14 states have internal predecessors, (41), 5 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-12 13:29:10,458 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 120 transitions. [2024-11-12 13:29:10,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-12 13:29:10,459 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:10,459 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:10,465 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 (18)] Ended with exit code 0 [2024-11-12 13:29:10,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-12 13:29:10,660 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-12 13:29:10,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:10,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1628395789, now seen corresponding path program 1 times [2024-11-12 13:29:10,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:10,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146931105] [2024-11-12 13:29:10,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:10,661 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-12 13:29:10,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:10,662 INFO L229 MonitoredProcess]: Starting monitored process 19 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-12 13:29:10,663 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 (19)] Waiting until timeout for monitored process [2024-11-12 13:29:10,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:10,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-12 13:29:10,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:10,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-12 13:29:10,927 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:29:10,928 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:11,071 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 13:29:11,072 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:11,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146931105] [2024-11-12 13:29:11,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146931105] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:11,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:11,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 16 [2024-11-12 13:29:11,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103627195] [2024-11-12 13:29:11,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:11,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-12 13:29:11,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:11,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-12 13:29:11,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2024-11-12 13:29:11,073 INFO L87 Difference]: Start difference. First operand 94 states and 120 transitions. Second operand has 17 states, 16 states have (on average 2.375) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:29:11,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:11,556 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2024-11-12 13:29:11,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-12 13:29:11,557 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2024-11-12 13:29:11,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:11,558 INFO L225 Difference]: With dead ends: 115 [2024-11-12 13:29:11,558 INFO L226 Difference]: Without dead ends: 115 [2024-11-12 13:29:11,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=694, Unknown=0, NotChecked=0, Total=812 [2024-11-12 13:29:11,560 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 58 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:11,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 275 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 13:29:11,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-12 13:29:11,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 101. [2024-11-12 13:29:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.271604938271605) internal successors, (103), 85 states have internal predecessors, (103), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (15), 12 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-12 13:29:11,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 126 transitions. [2024-11-12 13:29:11,564 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 126 transitions. Word has length 31 [2024-11-12 13:29:11,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:11,565 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 126 transitions. [2024-11-12 13:29:11,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.375) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:29:11,565 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 126 transitions. [2024-11-12 13:29:11,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-12 13:29:11,565 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:11,565 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:11,570 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 (19)] Ended with exit code 0 [2024-11-12 13:29:11,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-12 13:29:11,771 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-12 13:29:11,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:11,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1059338178, now seen corresponding path program 1 times [2024-11-12 13:29:11,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:11,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368449661] [2024-11-12 13:29:11,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:11,772 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-12 13:29:11,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:11,775 INFO L229 MonitoredProcess]: Starting monitored process 20 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-12 13:29:11,776 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 (20)] Waiting until timeout for monitored process [2024-11-12 13:29:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:11,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 13:29:11,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:12,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 13:29:12,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-12 13:29:12,578 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:29:12,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-12 13:29:12,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:12,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368449661] [2024-11-12 13:29:12,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368449661] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:12,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:12,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 21 [2024-11-12 13:29:12,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755391866] [2024-11-12 13:29:12,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:12,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-12 13:29:12,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:12,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-12 13:29:12,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-12 13:29:12,864 INFO L87 Difference]: Start difference. First operand 101 states and 126 transitions. Second operand has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 19 states have internal predecessors, (49), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-12 13:29:17,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:29:18,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:18,904 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2024-11-12 13:29:18,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-12 13:29:18,905 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 19 states have internal predecessors, (49), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 32 [2024-11-12 13:29:18,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:18,905 INFO L225 Difference]: With dead ends: 113 [2024-11-12 13:29:18,906 INFO L226 Difference]: Without dead ends: 113 [2024-11-12 13:29:18,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=205, Invalid=1055, Unknown=0, NotChecked=0, Total=1260 [2024-11-12 13:29:18,906 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 45 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:18,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 221 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 564 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2024-11-12 13:29:18,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-12 13:29:18,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2024-11-12 13:29:18,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 86 states have internal predecessors, (104), 8 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (15), 12 states have call predecessors, (15), 8 states have call successors, (15) [2024-11-12 13:29:18,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 127 transitions. [2024-11-12 13:29:18,910 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 127 transitions. Word has length 32 [2024-11-12 13:29:18,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:18,911 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 127 transitions. [2024-11-12 13:29:18,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 19 states have internal predecessors, (49), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-12 13:29:18,911 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 127 transitions. [2024-11-12 13:29:18,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 13:29:18,911 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:18,911 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:18,914 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 (20)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:19,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-12 13:29:19,112 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-12 13:29:19,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:19,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1520254763, now seen corresponding path program 1 times [2024-11-12 13:29:19,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:19,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403384483] [2024-11-12 13:29:19,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:19,113 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-12 13:29:19,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:19,115 INFO L229 MonitoredProcess]: Starting monitored process 21 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-12 13:29:19,116 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 (21)] Waiting until timeout for monitored process [2024-11-12 13:29:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:19,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 13:29:19,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:19,195 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-12 13:29:19,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 13:29:19,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2024-11-12 13:29:19,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-12 13:29:19,395 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:29:19,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:19,669 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:29:19,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:19,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403384483] [2024-11-12 13:29:19,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403384483] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:19,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:19,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-12 13:29:19,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423905940] [2024-11-12 13:29:19,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:19,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-12 13:29:19,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:19,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-12 13:29:19,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2024-11-12 13:29:19,671 INFO L87 Difference]: Start difference. First operand 102 states and 127 transitions. Second operand has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:29:20,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:20,774 INFO L93 Difference]: Finished difference Result 146 states and 184 transitions. [2024-11-12 13:29:20,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-12 13:29:20,775 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 33 [2024-11-12 13:29:20,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:20,775 INFO L225 Difference]: With dead ends: 146 [2024-11-12 13:29:20,775 INFO L226 Difference]: Without dead ends: 146 [2024-11-12 13:29:20,776 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2024-11-12 13:29:20,776 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 15 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:20,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 339 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 13:29:20,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-12 13:29:20,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 125. [2024-11-12 13:29:20,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 103 states have (on average 1.2718446601941749) internal successors, (131), 107 states have internal predecessors, (131), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (19), 14 states have call predecessors, (19), 10 states have call successors, (19) [2024-11-12 13:29:20,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 160 transitions. [2024-11-12 13:29:20,779 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 160 transitions. Word has length 33 [2024-11-12 13:29:20,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:20,779 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 160 transitions. [2024-11-12 13:29:20,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-12 13:29:20,779 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 160 transitions. [2024-11-12 13:29:20,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-12 13:29:20,780 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:20,780 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:20,784 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 (21)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:20,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-12 13:29:20,981 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-12 13:29:20,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:20,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1308903850, now seen corresponding path program 2 times [2024-11-12 13:29:20,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:20,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739689284] [2024-11-12 13:29:20,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:29:20,982 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-12 13:29:20,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:20,983 INFO L229 MonitoredProcess]: Starting monitored process 22 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-12 13:29:20,985 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 (22)] Waiting until timeout for monitored process [2024-11-12 13:29:21,028 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:29:21,028 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:29:21,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 13:29:21,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:21,081 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 13:29:21,081 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:29:21,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:21,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739689284] [2024-11-12 13:29:21,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739689284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:29:21,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:29:21,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 13:29:21,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339256846] [2024-11-12 13:29:21,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:29:21,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 13:29:21,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:21,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 13:29:21,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:29:21,082 INFO L87 Difference]: Start difference. First operand 125 states and 160 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:29:21,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:21,107 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2024-11-12 13:29:21,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:29:21,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-11-12 13:29:21,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:21,108 INFO L225 Difference]: With dead ends: 82 [2024-11-12 13:29:21,108 INFO L226 Difference]: Without dead ends: 78 [2024-11-12 13:29:21,108 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-12 13:29:21,108 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:21,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:29:21,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-12 13:29:21,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2024-11-12 13:29:21,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 58 states have (on average 1.206896551724138) internal successors, (70), 64 states have internal predecessors, (70), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-12 13:29:21,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2024-11-12 13:29:21,110 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 33 [2024-11-12 13:29:21,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:21,111 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2024-11-12 13:29:21,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 13:29:21,111 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2024-11-12 13:29:21,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-12 13:29:21,111 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:21,111 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:21,114 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 (22)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:21,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-12 13:29:21,314 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-12 13:29:21,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:21,315 INFO L85 PathProgramCache]: Analyzing trace with hash 520579815, now seen corresponding path program 1 times [2024-11-12 13:29:21,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:21,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425108706] [2024-11-12 13:29:21,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:21,315 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-12 13:29:21,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:21,317 INFO L229 MonitoredProcess]: Starting monitored process 23 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-12 13:29:21,318 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 (23)] Waiting until timeout for monitored process [2024-11-12 13:29:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:21,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 13:29:21,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 13:29:21,410 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:21,503 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-12 13:29:21,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:21,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425108706] [2024-11-12 13:29:21,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425108706] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:21,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:21,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-12 13:29:21,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030537981] [2024-11-12 13:29:21,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:21,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 13:29:21,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:21,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 13:29:21,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:29:21,504 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 13:29:21,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:21,602 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2024-11-12 13:29:21,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 13:29:21,602 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 36 [2024-11-12 13:29:21,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:21,603 INFO L225 Difference]: With dead ends: 80 [2024-11-12 13:29:21,603 INFO L226 Difference]: Without dead ends: 80 [2024-11-12 13:29:21,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-12 13:29:21,605 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 4 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:21,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 185 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:29:21,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-12 13:29:21,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-12 13:29:21,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.1875) internal successors, (76), 70 states have internal predecessors, (76), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-12 13:29:21,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2024-11-12 13:29:21,607 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 36 [2024-11-12 13:29:21,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:21,607 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2024-11-12 13:29:21,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 13:29:21,607 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2024-11-12 13:29:21,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-12 13:29:21,607 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:21,607 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:21,611 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 (23)] Ended with exit code 0 [2024-11-12 13:29:21,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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-12 13:29:21,808 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-12 13:29:21,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:21,808 INFO L85 PathProgramCache]: Analyzing trace with hash -159020851, now seen corresponding path program 2 times [2024-11-12 13:29:21,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:21,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642685641] [2024-11-12 13:29:21,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:29:21,809 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-12 13:29:21,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:21,811 INFO L229 MonitoredProcess]: Starting monitored process 24 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-12 13:29:21,812 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 (24)] Waiting until timeout for monitored process [2024-11-12 13:29:21,877 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:29:21,877 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:29:21,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-12 13:29:21,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:21,912 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-12 13:29:21,918 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 5 [2024-11-12 13:29:22,074 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-12 13:29:22,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:22,094 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-12 13:29:22,111 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:22,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:22,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:22,244 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-12 13:29:22,259 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:22,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:22,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:22,386 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-12 13:29:22,400 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:22,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:22,445 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 6 not checked. [2024-11-12 13:29:22,446 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:30,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:30,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642685641] [2024-11-12 13:29:30,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642685641] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:30,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [769677790] [2024-11-12 13:29:30,678 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:29:30,678 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-12 13:29:30,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-12 13:29:30,679 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-12 13:29:30,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-11-12 13:29:30,780 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:29:30,780 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:29:30,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-12 13:29:30,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:30,792 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-12 13:29:30,797 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 5 [2024-11-12 13:29:30,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:30,872 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-12 13:29:30,882 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:30,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:30,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:30,949 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-12 13:29:30,960 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:30,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:31,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-12 13:29:31,042 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-12 13:29:31,052 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-12 13:29:31,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-12 13:29:31,071 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 6 not checked. [2024-11-12 13:29:31,071 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:31,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [769677790] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 13:29:31,235 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:31,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2024-11-12 13:29:31,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833885696] [2024-11-12 13:29:31,235 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:31,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 13:29:31,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:31,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 13:29:31,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=170, Unknown=3, NotChecked=26, Total=240 [2024-11-12 13:29:31,236 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 14 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:31,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:29:31,721 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2024-11-12 13:29:31,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 13:29:31,721 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 38 [2024-11-12 13:29:31,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:29:31,722 INFO L225 Difference]: With dead ends: 84 [2024-11-12 13:29:31,722 INFO L226 Difference]: Without dead ends: 84 [2024-11-12 13:29:31,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=91, Invalid=462, Unknown=3, NotChecked=44, Total=600 [2024-11-12 13:29:31,723 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 54 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 13:29:31,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 236 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 279 Invalid, 0 Unknown, 69 Unchecked, 0.3s Time] [2024-11-12 13:29:31,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-12 13:29:31,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2024-11-12 13:29:31,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 64 states have (on average 1.171875) internal successors, (75), 70 states have internal predecessors, (75), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-12 13:29:31,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 88 transitions. [2024-11-12 13:29:31,725 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 88 transitions. Word has length 38 [2024-11-12 13:29:31,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:29:31,725 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 88 transitions. [2024-11-12 13:29:31,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.0) internal successors, (24), 13 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 13:29:31,725 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 88 transitions. [2024-11-12 13:29:31,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-12 13:29:31,725 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:29:31,726 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:29:31,729 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 (24)] Ended with exit code 0 [2024-11-12 13:29:31,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2024-11-12 13:29:32,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-12 13:29:32,129 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-12 13:29:32,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:29:32,129 INFO L85 PathProgramCache]: Analyzing trace with hash 2060951864, now seen corresponding path program 1 times [2024-11-12 13:29:32,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:29:32,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425993345] [2024-11-12 13:29:32,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:29:32,130 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-12 13:29:32,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:29:32,131 INFO L229 MonitoredProcess]: Starting monitored process 26 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-12 13:29:32,132 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 (26)] Waiting until timeout for monitored process [2024-11-12 13:29:32,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:29:32,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 13:29:32,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:29:32,193 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-12 13:29:32,292 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-12 13:29:32,293 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-12 13:29:32,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 13:29:32,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-12 13:29:36,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-12 13:29:36,587 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-12 13:29:36,618 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:29:36,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:29:37,175 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:29:37,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:29:37,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425993345] [2024-11-12 13:29:37,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425993345] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:29:37,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:29:37,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2024-11-12 13:29:37,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666862155] [2024-11-12 13:29:37,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:29:37,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-12 13:29:37,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:29:37,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-12 13:29:37,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=523, Unknown=1, NotChecked=0, Total=600 [2024-11-12 13:29:37,177 INFO L87 Difference]: Start difference. First operand 80 states and 88 transitions. Second operand has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 21 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-12 13:29:41,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:29:45,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:29:49,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:29:53,667 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:29:57,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:30:01,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-12 13:30:02,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:30:02,076 INFO L93 Difference]: Finished difference Result 91 states and 101 transitions. [2024-11-12 13:30:02,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-12 13:30:02,077 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 21 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2024-11-12 13:30:02,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:30:02,077 INFO L225 Difference]: With dead ends: 91 [2024-11-12 13:30:02,077 INFO L226 Difference]: Without dead ends: 91 [2024-11-12 13:30:02,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=132, Invalid=989, Unknown=1, NotChecked=0, Total=1122 [2024-11-12 13:30:02,078 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 21 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 10 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.6s IncrementalHoareTripleChecker+Time [2024-11-12 13:30:02,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 178 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 602 Invalid, 6 Unknown, 0 Unchecked, 24.6s Time] [2024-11-12 13:30:02,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-12 13:30:02,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-11-12 13:30:02,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.2) internal successors, (84), 76 states have internal predecessors, (84), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (8), 7 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-12 13:30:02,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 97 transitions. [2024-11-12 13:30:02,080 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 97 transitions. Word has length 38 [2024-11-12 13:30:02,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:30:02,080 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 97 transitions. [2024-11-12 13:30:02,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 21 states have internal predecessors, (53), 5 states have call successors, (5), 5 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-12 13:30:02,081 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 97 transitions. [2024-11-12 13:30:02,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-12 13:30:02,081 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:30:02,081 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:30:02,084 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 (26)] Forceful destruction successful, exit code 0 [2024-11-12 13:30:02,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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-12 13:30:02,281 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-12 13:30:02,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:30:02,282 INFO L85 PathProgramCache]: Analyzing trace with hash 594821051, now seen corresponding path program 1 times [2024-11-12 13:30:02,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:30:02,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908267155] [2024-11-12 13:30:02,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:30:02,282 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-12 13:30:02,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:30:02,285 INFO L229 MonitoredProcess]: Starting monitored process 27 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-12 13:30:02,285 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 (27)] Waiting until timeout for monitored process [2024-11-12 13:30:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:30:02,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-12 13:30:02,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:30:02,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-12 13:30:02,764 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-12 13:30:02,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 29 [2024-11-12 13:30:02,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2024-11-12 13:30:11,217 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_entry_point_#t~mem45#1.base_19| (_ BitVec 32)) (|v_ULTIMATE.start_entry_point_~array~0#1.base_32| (_ BitVec 32))) (and (= (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_#t~mem45#1.base_19| (_ bv0 1)) |v_ULTIMATE.start_entry_point_~array~0#1.base_32| (_ bv0 1)) |c_#valid|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_#t~mem45#1.base_19|) (_ bv0 1)) (not (= |v_ULTIMATE.start_entry_point_~array~0#1.base_32| (_ bv0 32))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~array~0#1.base_32|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_entry_point_~array~0#1.base_32| (_ bv1 1)) |v_ULTIMATE.start_entry_point_#t~mem45#1.base_19| (_ bv0 1)) |v_ULTIMATE.start_entry_point_~array~0#1.base_32|))))) is different from true [2024-11-12 13:30:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-12 13:30:11,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:30:11,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22