./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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/uthash-2.0.2/uthash_SAX_test6-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 ff5be3465740cb655882704e7eef418c95d0bbd56a2060e741c7d3e996e58af7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:14:43,014 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:14:43,067 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:14:43,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:14:43,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:14:43,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:14:43,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:14:43,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:14:43,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:14:43,097 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:14:43,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:14:43,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:14:43,098 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:14:43,099 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:14:43,100 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:14:43,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:14:43,100 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:14:43,100 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:14:43,100 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:14:43,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:14:43,101 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:14:43,104 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:14:43,104 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:14:43,104 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:14:43,104 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:14:43,104 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:14:43,105 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:14:43,105 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:14:43,105 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:14:43,105 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:14:43,105 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:14:43,105 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:14:43,105 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:14:43,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:14:43,106 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:14:43,106 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:14:43,106 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:14:43,106 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:14:43,106 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:14:43,106 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:14:43,107 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:14:43,107 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:14:43,107 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 -> ff5be3465740cb655882704e7eef418c95d0bbd56a2060e741c7d3e996e58af7 [2024-11-09 10:14:43,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:14:43,357 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:14:43,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:14:43,360 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:14:43,360 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:14:43,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i [2024-11-09 10:14:44,673 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:14:44,947 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:14:44,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i [2024-11-09 10:14:44,976 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10add1765/e85414f4946541ee8846753cb3d57bfa/FLAG796be3ee9 [2024-11-09 10:14:45,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/10add1765/e85414f4946541ee8846753cb3d57bfa [2024-11-09 10:14:45,265 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:14:45,267 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:14:45,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:14:45,269 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:14:45,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:14:45,274 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:14:45" (1/1) ... [2024-11-09 10:14:45,275 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1696d76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:14:45, skipping insertion in model container [2024-11-09 10:14:45,275 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:14:45" (1/1) ... [2024-11-09 10:14:45,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:14:45,718 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-09 10:14:45,743 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-09 10:14:45,745 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-09 10:14:45,747 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-09 10:14:45,752 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-09 10:14:45,776 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-09 10:14:45,777 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-09 10:14:45,778 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-09 10:14:45,779 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-09 10:14:45,781 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-09 10:14:45,782 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-09 10:14:45,783 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-09 10:14:45,783 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-09 10:14:45,786 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-09 10:14:45,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:14:45,819 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-09 10:14:45,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2b67f378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:14:45, skipping insertion in model container [2024-11-09 10:14:45,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:14:45,820 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 10:14:45,822 INFO L158 Benchmark]: Toolchain (without parser) took 553.95ms. Allocated memory is still 182.5MB. Free memory was 152.9MB in the beginning and 127.3MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 10:14:45,822 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 134.2MB. Free memory is still 98.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:14:45,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 552.33ms. Allocated memory is still 182.5MB. Free memory was 152.1MB in the beginning and 127.3MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 10:14:45,823 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.14ms. Allocated memory is still 134.2MB. Free memory is still 98.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 552.33ms. Allocated memory is still 182.5MB. Free memory was 152.1MB in the beginning and 127.3MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1001]: 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/uthash-2.0.2/uthash_SAX_test6-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 ff5be3465740cb655882704e7eef418c95d0bbd56a2060e741c7d3e996e58af7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:14:47,743 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:14:47,793 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:14:47,797 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:14:47,797 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:14:47,813 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:14:47,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:14:47,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:14:47,815 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:14:47,815 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:14:47,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:14:47,816 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:14:47,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:14:47,817 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:14:47,817 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:14:47,817 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:14:47,818 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:14:47,818 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:14:47,818 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:14:47,818 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:14:47,819 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:14:47,819 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:14:47,820 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:14:47,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:14:47,820 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:14:47,821 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:14:47,821 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:14:47,821 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:14:47,822 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:14:47,822 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:14:47,822 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:14:47,822 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:14:47,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:14:47,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:14:47,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:14:47,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:14:47,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:14:47,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:14:47,824 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:14:47,824 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:14:47,825 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:14:47,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:14:47,825 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:14:47,825 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:14:47,826 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 -> ff5be3465740cb655882704e7eef418c95d0bbd56a2060e741c7d3e996e58af7 [2024-11-09 10:14:48,107 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:14:48,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:14:48,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:14:48,134 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:14:48,138 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:14:48,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i [2024-11-09 10:14:49,550 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:14:49,778 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:14:49,779 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-1.i [2024-11-09 10:14:49,792 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e01151564/c0acc00efed340e8a00eb783081a4ec0/FLAGdb1d704fd [2024-11-09 10:14:49,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e01151564/c0acc00efed340e8a00eb783081a4ec0 [2024-11-09 10:14:49,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:14:49,808 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:14:49,813 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:14:49,813 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:14:49,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:14:49,820 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:14:49" (1/1) ... [2024-11-09 10:14:49,821 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74af45e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:14:49, skipping insertion in model container [2024-11-09 10:14:49,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:14:49" (1/1) ... [2024-11-09 10:14:49,873 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:14:50,313 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-09 10:14:50,342 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-09 10:14:50,345 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-09 10:14:50,349 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-09 10:14:50,357 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-09 10:14:50,395 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-09 10:14:50,399 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-09 10:14:50,401 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-09 10:14:50,401 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-09 10:14:50,403 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-09 10:14:50,404 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-09 10:14:50,405 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-09 10:14:50,406 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-09 10:14:50,408 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-09 10:14:50,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:14:50,430 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 10:14:50,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:14:50,474 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-09 10:14:50,487 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-09 10:14:50,489 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-09 10:14:50,491 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-09 10:14:50,496 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-09 10:14:50,526 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-09 10:14:50,526 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-09 10:14:50,528 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-09 10:14:50,528 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-09 10:14:50,533 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-09 10:14:50,538 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-09 10:14:50,538 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-09 10:14:50,539 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-09 10:14:50,541 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-09 10:14:50,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:14:50,555 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:14:50,661 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:14:50,707 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:14:50,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:14:50 WrapperNode [2024-11-09 10:14:50,708 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:14:50,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:14:50,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:14:50,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:14:50,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:14:50" (1/1) ... [2024-11-09 10:14:50,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:14:50" (1/1) ... [2024-11-09 10:14:50,816 INFO L138 Inliner]: procedures = 286, calls = 300, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1078 [2024-11-09 10:14:50,820 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:14:50,821 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:14:50,821 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:14:50,821 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:14:50,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:14:50" (1/1) ... [2024-11-09 10:14:50,834 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:14:50" (1/1) ... [2024-11-09 10:14:50,841 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:14:50" (1/1) ... [2024-11-09 10:14:50,918 INFO L175 MemorySlicer]: Split 268 memory accesses to 4 slices as follows [2, 34, 12, 220]. 82 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 10, 0]. The 54 writes are split as follows [0, 4, 1, 49]. [2024-11-09 10:14:50,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:14:50" (1/1) ... [2024-11-09 10:14:50,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:14:50" (1/1) ... [2024-11-09 10:14:50,941 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:14:50" (1/1) ... [2024-11-09 10:14:50,947 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:14:50" (1/1) ... [2024-11-09 10:14:50,951 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:14:50" (1/1) ... [2024-11-09 10:14:50,955 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:14:50" (1/1) ... [2024-11-09 10:14:50,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:14:50,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:14:50,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:14:50,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:14:50,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:14:50" (1/1) ... [2024-11-09 10:14:50,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:14:50,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:14:51,002 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-09 10:14:51,011 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-09 10:14:51,045 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 10:14:51,046 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 10:14:51,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 10:14:51,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 10:14:51,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 10:14:51,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-09 10:14:51,046 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 10:14:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 10:14:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 10:14:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-09 10:14:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:14:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:14:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:14:51,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 10:14:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 10:14:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:14:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 10:14:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 10:14:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 10:14:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-09 10:14:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 10:14:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 10:14:51,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 10:14:51,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-09 10:14:51,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-09 10:14:51,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-09 10:14:51,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-09 10:14:51,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-09 10:14:51,050 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-09 10:14:51,050 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-09 10:14:51,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 10:14:51,050 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 10:14:51,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:14:51,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:14:51,050 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-09 10:14:51,050 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-09 10:14:51,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:14:51,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:14:51,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 10:14:51,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 10:14:51,050 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-09 10:14:51,051 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-09 10:14:51,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:14:51,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:14:51,227 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:14:51,228 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:14:54,185 INFO L? ?]: Removed 1086 outVars from TransFormulas that were not future-live. [2024-11-09 10:14:54,186 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:14:54,210 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:14:54,210 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-09 10:14:54,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:14:54 BoogieIcfgContainer [2024-11-09 10:14:54,211 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:14:54,212 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:14:54,212 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:14:54,215 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:14:54,218 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:14:49" (1/3) ... [2024-11-09 10:14:54,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f17c0c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:14:54, skipping insertion in model container [2024-11-09 10:14:54,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:14:50" (2/3) ... [2024-11-09 10:14:54,219 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f17c0c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:14:54, skipping insertion in model container [2024-11-09 10:14:54,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:14:54" (3/3) ... [2024-11-09 10:14:54,220 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test6-1.i [2024-11-09 10:14:54,245 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:14:54,249 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 522 error locations. [2024-11-09 10:14:54,307 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:14:54,312 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;@585f34bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:14:54,312 INFO L334 AbstractCegarLoop]: Starting to check reachability of 522 error locations. [2024-11-09 10:14:54,318 INFO L276 IsEmpty]: Start isEmpty. Operand has 1085 states, 540 states have (on average 2.198148148148148) internal successors, (1187), 1065 states have internal predecessors, (1187), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 10:14:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 10:14:54,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:14:54,329 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 10:14:54,330 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:14:54,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:14:54,334 INFO L85 PathProgramCache]: Analyzing trace with hash 85465, now seen corresponding path program 1 times [2024-11-09 10:14:54,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:14:54,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181446261] [2024-11-09 10:14:54,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:14:54,347 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-09 10:14:54,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:14:54,353 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-09 10:14:54,355 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-09 10:14:54,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:14:54,492 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:14:54,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:14:54,539 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-09 10:14:54,552 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-09 10:14:54,553 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:14:54,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:14:54,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181446261] [2024-11-09 10:14:54,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181446261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:14:54,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:14:54,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:14:54,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034433564] [2024-11-09 10:14:54,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:14:54,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:14:54,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:14:54,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:14:54,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:14:54,612 INFO L87 Difference]: Start difference. First operand has 1085 states, 540 states have (on average 2.198148148148148) internal successors, (1187), 1065 states have internal predecessors, (1187), 18 states have call successors, (18), 5 states have call predecessors, (18), 5 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:14:55,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:14:55,916 INFO L93 Difference]: Finished difference Result 1165 states and 1235 transitions. [2024-11-09 10:14:55,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:14:55,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 10:14:55,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:14:55,935 INFO L225 Difference]: With dead ends: 1165 [2024-11-09 10:14:55,935 INFO L226 Difference]: Without dead ends: 1163 [2024-11-09 10:14:55,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:14:55,939 INFO L432 NwaCegarLoop]: 796 mSDtfsCounter, 720 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1042 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:14:55,943 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1042 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 10:14:55,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2024-11-09 10:14:56,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1106. [2024-11-09 10:14:56,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 576 states have (on average 2.0572916666666665) internal successors, (1185), 1088 states have internal predecessors, (1185), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:14:56,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1215 transitions. [2024-11-09 10:14:56,074 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1215 transitions. Word has length 3 [2024-11-09 10:14:56,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:14:56,075 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1215 transitions. [2024-11-09 10:14:56,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:14:56,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1215 transitions. [2024-11-09 10:14:56,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-09 10:14:56,075 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:14:56,075 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-09 10:14:56,088 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-09 10:14:56,278 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-09 10:14:56,278 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:14:56,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:14:56,279 INFO L85 PathProgramCache]: Analyzing trace with hash 85466, now seen corresponding path program 1 times [2024-11-09 10:14:56,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:14:56,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771734182] [2024-11-09 10:14:56,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:14:56,280 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-09 10:14:56,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:14:56,283 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-09 10:14:56,284 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-09 10:14:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:14:56,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:14:56,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:14:56,433 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-09 10:14:56,450 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-09 10:14:56,450 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:14:56,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:14:56,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771734182] [2024-11-09 10:14:56,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [771734182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:14:56,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:14:56,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:14:56,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807221554] [2024-11-09 10:14:56,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:14:56,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:14:56,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:14:56,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:14:56,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:14:56,452 INFO L87 Difference]: Start difference. First operand 1106 states and 1215 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:14:58,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:14:58,262 INFO L93 Difference]: Finished difference Result 1510 states and 1656 transitions. [2024-11-09 10:14:58,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:14:58,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-09 10:14:58,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:14:58,267 INFO L225 Difference]: With dead ends: 1510 [2024-11-09 10:14:58,267 INFO L226 Difference]: Without dead ends: 1510 [2024-11-09 10:14:58,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:14:58,269 INFO L432 NwaCegarLoop]: 936 mSDtfsCounter, 428 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:14:58,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 1538 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 10:14:58,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2024-11-09 10:14:58,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1319. [2024-11-09 10:14:58,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 788 states have (on average 2.0431472081218276) internal successors, (1610), 1299 states have internal predecessors, (1610), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 10:14:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1644 transitions. [2024-11-09 10:14:58,296 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1644 transitions. Word has length 3 [2024-11-09 10:14:58,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:14:58,297 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 1644 transitions. [2024-11-09 10:14:58,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:14:58,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1644 transitions. [2024-11-09 10:14:58,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 10:14:58,297 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:14:58,297 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:14:58,308 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-09 10:14:58,500 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-09 10:14:58,501 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:14:58,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:14:58,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1307350193, now seen corresponding path program 1 times [2024-11-09 10:14:58,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:14:58,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1401636855] [2024-11-09 10:14:58,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:14:58,502 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-09 10:14:58,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:14:58,505 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-09 10:14:58,506 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-09 10:14:58,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:14:58,707 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:14:58,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:14:58,722 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-09 10:14:58,730 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-09 10:14:58,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:14:58,790 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-09 10:14:58,805 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:14:58,805 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-09 10:14:58,839 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-09 10:14:58,839 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:14:58,839 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:14:58,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1401636855] [2024-11-09 10:14:58,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1401636855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:14:58,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:14:58,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:14:58,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860447508] [2024-11-09 10:14:58,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:14:58,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:14:58,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:14:58,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:14:58,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:14:58,840 INFO L87 Difference]: Start difference. First operand 1319 states and 1644 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:01,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:01,938 INFO L93 Difference]: Finished difference Result 2025 states and 2408 transitions. [2024-11-09 10:15:01,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:15:01,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-09 10:15:01,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:01,955 INFO L225 Difference]: With dead ends: 2025 [2024-11-09 10:15:01,956 INFO L226 Difference]: Without dead ends: 2025 [2024-11-09 10:15:01,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:15:01,959 INFO L432 NwaCegarLoop]: 643 mSDtfsCounter, 734 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 1792 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 738 SdHoareTripleChecker+Valid, 1585 SdHoareTripleChecker+Invalid, 1804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1792 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:01,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [738 Valid, 1585 Invalid, 1804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1792 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-09 10:15:01,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2025 states. [2024-11-09 10:15:01,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2025 to 1468. [2024-11-09 10:15:01,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1468 states, 937 states have (on average 2.024546424759872) internal successors, (1897), 1448 states have internal predecessors, (1897), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 10:15:01,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1468 states to 1468 states and 1931 transitions. [2024-11-09 10:15:01,989 INFO L78 Accepts]: Start accepts. Automaton has 1468 states and 1931 transitions. Word has length 8 [2024-11-09 10:15:01,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:01,991 INFO L471 AbstractCegarLoop]: Abstraction has 1468 states and 1931 transitions. [2024-11-09 10:15:01,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:01,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1468 states and 1931 transitions. [2024-11-09 10:15:01,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 10:15:01,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:01,992 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:15:01,998 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 (4)] Ended with exit code 0 [2024-11-09 10:15:02,192 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-09 10:15:02,194 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:15:02,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:02,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1873150296, now seen corresponding path program 1 times [2024-11-09 10:15:02,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:15:02,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370014136] [2024-11-09 10:15:02,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:02,195 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-09 10:15:02,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:15:02,199 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-09 10:15:02,200 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-09 10:15:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:02,317 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:15:02,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:02,330 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-09 10:15:02,364 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-09 10:15:02,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:15:02,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:15:02,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370014136] [2024-11-09 10:15:02,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370014136] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:02,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:02,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:15:02,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817370111] [2024-11-09 10:15:02,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:02,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:15:02,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:15:02,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:15:02,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:15:02,370 INFO L87 Difference]: Start difference. First operand 1468 states and 1931 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:04,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:04,330 INFO L93 Difference]: Finished difference Result 2015 states and 2706 transitions. [2024-11-09 10:15:04,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:15:04,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 10:15:04,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:04,340 INFO L225 Difference]: With dead ends: 2015 [2024-11-09 10:15:04,341 INFO L226 Difference]: Without dead ends: 2015 [2024-11-09 10:15:04,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:15:04,341 INFO L432 NwaCegarLoop]: 1015 mSDtfsCounter, 924 mSDsluCounter, 1078 mSDsCounter, 0 mSdLazyCounter, 1476 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 927 SdHoareTripleChecker+Valid, 2093 SdHoareTripleChecker+Invalid, 1525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:04,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [927 Valid, 2093 Invalid, 1525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1476 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 10:15:04,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2015 states. [2024-11-09 10:15:04,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2015 to 1423. [2024-11-09 10:15:04,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 937 states have (on average 1.961579509071505) internal successors, (1838), 1403 states have internal predecessors, (1838), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 10:15:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 1872 transitions. [2024-11-09 10:15:04,386 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 1872 transitions. Word has length 9 [2024-11-09 10:15:04,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:04,387 INFO L471 AbstractCegarLoop]: Abstraction has 1423 states and 1872 transitions. [2024-11-09 10:15:04,387 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:04,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 1872 transitions. [2024-11-09 10:15:04,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 10:15:04,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:04,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:15:04,394 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-09 10:15:04,590 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-09 10:15:04,591 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:15:04,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:04,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1873150295, now seen corresponding path program 1 times [2024-11-09 10:15:04,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:15:04,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258310390] [2024-11-09 10:15:04,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:04,593 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-09 10:15:04,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:15:04,596 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-09 10:15:04,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 10:15:04,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:04,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:15:04,697 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:04,708 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-09 10:15:04,742 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-09 10:15:04,742 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:15:04,743 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:15:04,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258310390] [2024-11-09 10:15:04,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258310390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:04,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:04,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:15:04,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615762041] [2024-11-09 10:15:04,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:04,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:15:04,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:15:04,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:15:04,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:15:04,744 INFO L87 Difference]: Start difference. First operand 1423 states and 1872 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:07,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:07,306 INFO L93 Difference]: Finished difference Result 2079 states and 2728 transitions. [2024-11-09 10:15:07,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:15:07,307 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 10:15:07,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:07,313 INFO L225 Difference]: With dead ends: 2079 [2024-11-09 10:15:07,313 INFO L226 Difference]: Without dead ends: 2079 [2024-11-09 10:15:07,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:15:07,314 INFO L432 NwaCegarLoop]: 1191 mSDtfsCounter, 704 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 2448 SdHoareTripleChecker+Invalid, 1477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:07,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 2448 Invalid, 1477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-09 10:15:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2079 states. [2024-11-09 10:15:07,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2079 to 1415. [2024-11-09 10:15:07,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 939 states have (on average 1.933972310969116) internal successors, (1816), 1395 states have internal predecessors, (1816), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 10:15:07,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 1850 transitions. [2024-11-09 10:15:07,357 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 1850 transitions. Word has length 9 [2024-11-09 10:15:07,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:07,357 INFO L471 AbstractCegarLoop]: Abstraction has 1415 states and 1850 transitions. [2024-11-09 10:15:07,358 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:07,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 1850 transitions. [2024-11-09 10:15:07,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 10:15:07,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:07,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:15:07,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 10:15:07,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:15:07,559 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:15:07,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:07,560 INFO L85 PathProgramCache]: Analyzing trace with hash -325578228, now seen corresponding path program 1 times [2024-11-09 10:15:07,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:15:07,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549759734] [2024-11-09 10:15:07,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:07,561 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-09 10:15:07,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:15:07,563 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:15:07,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 10:15:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:07,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:15:07,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:07,713 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-09 10:15:07,713 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:15:07,713 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:15:07,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [549759734] [2024-11-09 10:15:07,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [549759734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:07,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:07,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:15:07,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659743603] [2024-11-09 10:15:07,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:07,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:15:07,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:15:07,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:15:07,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:15:07,715 INFO L87 Difference]: Start difference. First operand 1415 states and 1850 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:08,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:08,211 INFO L93 Difference]: Finished difference Result 1863 states and 2408 transitions. [2024-11-09 10:15:08,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:15:08,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 10:15:08,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:08,218 INFO L225 Difference]: With dead ends: 1863 [2024-11-09 10:15:08,218 INFO L226 Difference]: Without dead ends: 1863 [2024-11-09 10:15:08,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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-09 10:15:08,219 INFO L432 NwaCegarLoop]: 1155 mSDtfsCounter, 455 mSDsluCounter, 2040 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 3195 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:08,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 3195 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 10:15:08,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2024-11-09 10:15:08,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1671. [2024-11-09 10:15:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1195 states have (on average 1.9489539748953975) internal successors, (2329), 1651 states have internal predecessors, (2329), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 10:15:08,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2363 transitions. [2024-11-09 10:15:08,243 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2363 transitions. Word has length 13 [2024-11-09 10:15:08,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:08,243 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2363 transitions. [2024-11-09 10:15:08,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:08,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2363 transitions. [2024-11-09 10:15:08,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 10:15:08,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:08,244 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:15:08,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 10:15:08,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:15:08,445 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr322REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:15:08,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:08,446 INFO L85 PathProgramCache]: Analyzing trace with hash -922136276, now seen corresponding path program 1 times [2024-11-09 10:15:08,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:15:08,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997197681] [2024-11-09 10:15:08,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:08,446 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-09 10:15:08,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:15:08,448 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-09 10:15:08,449 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-09 10:15:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:08,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:15:08,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:08,604 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-09 10:15:08,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:15:08,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:15:08,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997197681] [2024-11-09 10:15:08,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997197681] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:08,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:08,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:15:08,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740352385] [2024-11-09 10:15:08,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:08,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:15:08,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:15:08,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:15:08,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:15:08,606 INFO L87 Difference]: Start difference. First operand 1671 states and 2363 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:08,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:08,638 INFO L93 Difference]: Finished difference Result 1575 states and 2191 transitions. [2024-11-09 10:15:08,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:15:08,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-09 10:15:08,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:08,646 INFO L225 Difference]: With dead ends: 1575 [2024-11-09 10:15:08,646 INFO L226 Difference]: Without dead ends: 1575 [2024-11-09 10:15:08,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:15:08,647 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 71 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1971 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:08,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1971 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:15:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2024-11-09 10:15:08,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1575. [2024-11-09 10:15:08,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1575 states, 1123 states have (on average 1.9207479964381122) internal successors, (2157), 1555 states have internal predecessors, (2157), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-09 10:15:08,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1575 states to 1575 states and 2191 transitions. [2024-11-09 10:15:08,672 INFO L78 Accepts]: Start accepts. Automaton has 1575 states and 2191 transitions. Word has length 13 [2024-11-09 10:15:08,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:08,672 INFO L471 AbstractCegarLoop]: Abstraction has 1575 states and 2191 transitions. [2024-11-09 10:15:08,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:08,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1575 states and 2191 transitions. [2024-11-09 10:15:08,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 10:15:08,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:08,674 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:15:08,681 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-09 10:15:08,874 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-09 10:15:08,875 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:15:08,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:08,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1373575884, now seen corresponding path program 1 times [2024-11-09 10:15:08,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:15:08,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [349526042] [2024-11-09 10:15:08,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:08,876 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-09 10:15:08,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:15:08,878 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-09 10:15:08,879 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-09 10:15:09,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:09,022 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:15:09,024 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:09,029 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:15:09,030 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:15:09,030 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:15:09,035 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 30 treesize of output 39 [2024-11-09 10:15:09,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:15:09,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-09 10:15:09,085 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-09 10:15:09,085 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:15:09,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:15:09,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [349526042] [2024-11-09 10:15:09,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [349526042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:09,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:09,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:15:09,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807737319] [2024-11-09 10:15:09,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:09,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:15:09,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:15:09,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:15:09,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:15:09,087 INFO L87 Difference]: Start difference. First operand 1575 states and 2191 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:09,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:09,492 INFO L93 Difference]: Finished difference Result 2100 states and 2505 transitions. [2024-11-09 10:15:09,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:15:09,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-09 10:15:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:09,499 INFO L225 Difference]: With dead ends: 2100 [2024-11-09 10:15:09,499 INFO L226 Difference]: Without dead ends: 2100 [2024-11-09 10:15:09,499 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:15:09,500 INFO L432 NwaCegarLoop]: 1004 mSDtfsCounter, 899 mSDsluCounter, 1981 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 2985 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:09,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 2985 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 10:15:09,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2024-11-09 10:15:09,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1240. [2024-11-09 10:15:09,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 790 states have (on average 1.9037974683544303) internal successors, (1504), 1222 states have internal predecessors, (1504), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:15:09,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1534 transitions. [2024-11-09 10:15:09,515 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1534 transitions. Word has length 16 [2024-11-09 10:15:09,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:09,515 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1534 transitions. [2024-11-09 10:15:09,515 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:09,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1534 transitions. [2024-11-09 10:15:09,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 10:15:09,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:09,515 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:15:09,529 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-09 10:15:09,716 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-09 10:15:09,717 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:15:09,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:09,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1057218028, now seen corresponding path program 1 times [2024-11-09 10:15:09,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:15:09,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122443704] [2024-11-09 10:15:09,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:09,718 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-09 10:15:09,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:15:09,721 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-09 10:15:09,729 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-09 10:15:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:09,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 10:15:09,906 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:09,918 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-09 10:15:09,919 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:15:09,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:15:09,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122443704] [2024-11-09 10:15:09,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122443704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:09,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:09,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:15:09,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312574396] [2024-11-09 10:15:09,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:09,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:15:09,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:15:09,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:15:09,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:15:09,923 INFO L87 Difference]: Start difference. First operand 1240 states and 1534 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:09,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:09,952 INFO L93 Difference]: Finished difference Result 1180 states and 1448 transitions. [2024-11-09 10:15:09,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:15:09,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-09 10:15:09,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:09,955 INFO L225 Difference]: With dead ends: 1180 [2024-11-09 10:15:09,955 INFO L226 Difference]: Without dead ends: 1180 [2024-11-09 10:15:09,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:15:09,956 INFO L432 NwaCegarLoop]: 974 mSDtfsCounter, 71 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:09,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1885 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:15:09,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2024-11-09 10:15:09,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 1180. [2024-11-09 10:15:09,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 754 states have (on average 1.8806366047745358) internal successors, (1418), 1162 states have internal predecessors, (1418), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:15:09,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1448 transitions. [2024-11-09 10:15:09,971 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1448 transitions. Word has length 19 [2024-11-09 10:15:09,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:09,971 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1448 transitions. [2024-11-09 10:15:09,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:09,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1448 transitions. [2024-11-09 10:15:09,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 10:15:09,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:09,973 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:15:09,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-09 10:15:10,176 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-09 10:15:10,177 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:15:10,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:10,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1920722190, now seen corresponding path program 1 times [2024-11-09 10:15:10,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:15:10,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991713689] [2024-11-09 10:15:10,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:10,178 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-09 10:15:10,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:15:10,179 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-09 10:15:10,181 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-09 10:15:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:10,326 INFO L255 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:15:10,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:10,339 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-09 10:15:10,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:15:10,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:15:10,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991713689] [2024-11-09 10:15:10,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991713689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:10,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:10,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:15:10,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665393446] [2024-11-09 10:15:10,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:10,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:15:10,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:15:10,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:15:10,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:15:10,341 INFO L87 Difference]: Start difference. First operand 1180 states and 1448 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:10,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:10,395 INFO L93 Difference]: Finished difference Result 1150 states and 1390 transitions. [2024-11-09 10:15:10,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:15:10,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-09 10:15:10,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:10,398 INFO L225 Difference]: With dead ends: 1150 [2024-11-09 10:15:10,399 INFO L226 Difference]: Without dead ends: 1150 [2024-11-09 10:15:10,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:15:10,399 INFO L432 NwaCegarLoop]: 929 mSDtfsCounter, 48 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:10,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 2761 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:15:10,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-11-09 10:15:10,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1150. [2024-11-09 10:15:10,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 738 states have (on average 1.8428184281842819) internal successors, (1360), 1132 states have internal predecessors, (1360), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:15:10,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1390 transitions. [2024-11-09 10:15:10,411 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1390 transitions. Word has length 21 [2024-11-09 10:15:10,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:10,412 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1390 transitions. [2024-11-09 10:15:10,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:10,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1390 transitions. [2024-11-09 10:15:10,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 10:15:10,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:10,413 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:15:10,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-09 10:15:10,614 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-09 10:15:10,615 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:15:10,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:10,616 INFO L85 PathProgramCache]: Analyzing trace with hash -956254243, now seen corresponding path program 1 times [2024-11-09 10:15:10,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:15:10,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443809557] [2024-11-09 10:15:10,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:10,617 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-09 10:15:10,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:15:10,620 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-09 10:15:10,621 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-09 10:15:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:10,771 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 10:15:10,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:10,785 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-09 10:15:10,967 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-09 10:15:10,967 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:15:10,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:15:10,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443809557] [2024-11-09 10:15:10,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443809557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:10,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:10,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:15:10,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748099829] [2024-11-09 10:15:10,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:10,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:15:10,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:15:10,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:15:10,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:15:10,969 INFO L87 Difference]: Start difference. First operand 1150 states and 1390 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:13,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:13,765 INFO L93 Difference]: Finished difference Result 1703 states and 2070 transitions. [2024-11-09 10:15:13,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:15:13,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-09 10:15:13,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:13,769 INFO L225 Difference]: With dead ends: 1703 [2024-11-09 10:15:13,769 INFO L226 Difference]: Without dead ends: 1703 [2024-11-09 10:15:13,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:15:13,770 INFO L432 NwaCegarLoop]: 1175 mSDtfsCounter, 594 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 596 SdHoareTripleChecker+Valid, 3121 SdHoareTripleChecker+Invalid, 1997 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:13,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [596 Valid, 3121 Invalid, 1997 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-09 10:15:13,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2024-11-09 10:15:13,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1146. [2024-11-09 10:15:13,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 738 states have (on average 1.8319783197831978) internal successors, (1352), 1128 states have internal predecessors, (1352), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:15:13,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1382 transitions. [2024-11-09 10:15:13,782 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1382 transitions. Word has length 35 [2024-11-09 10:15:13,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:13,782 INFO L471 AbstractCegarLoop]: Abstraction has 1146 states and 1382 transitions. [2024-11-09 10:15:13,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:13,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1382 transitions. [2024-11-09 10:15:13,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 10:15:13,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:13,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:15:13,789 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-09 10:15:13,987 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-09 10:15:13,988 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:15:13,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:13,988 INFO L85 PathProgramCache]: Analyzing trace with hash -956254244, now seen corresponding path program 1 times [2024-11-09 10:15:13,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:15:13,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196245039] [2024-11-09 10:15:13,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:13,989 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-09 10:15:13,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:15:13,991 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-09 10:15:13,992 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-09 10:15:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:14,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:15:14,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:14,168 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-09 10:15:14,232 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-09 10:15:14,232 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:15:14,232 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:15:14,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196245039] [2024-11-09 10:15:14,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196245039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:14,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:14,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:15:14,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411201972] [2024-11-09 10:15:14,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:14,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:15:14,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:15:14,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:15:14,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:15:14,234 INFO L87 Difference]: Start difference. First operand 1146 states and 1382 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:16,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:16,120 INFO L93 Difference]: Finished difference Result 1572 states and 1929 transitions. [2024-11-09 10:15:16,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:15:16,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-09 10:15:16,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:16,125 INFO L225 Difference]: With dead ends: 1572 [2024-11-09 10:15:16,125 INFO L226 Difference]: Without dead ends: 1572 [2024-11-09 10:15:16,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:15:16,126 INFO L432 NwaCegarLoop]: 535 mSDtfsCounter, 810 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 1557 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:16,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 1752 Invalid, 1565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1557 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 10:15:16,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2024-11-09 10:15:16,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1142. [2024-11-09 10:15:16,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 738 states have (on average 1.8211382113821137) internal successors, (1344), 1124 states have internal predecessors, (1344), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:15:16,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1374 transitions. [2024-11-09 10:15:16,158 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1374 transitions. Word has length 35 [2024-11-09 10:15:16,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:16,158 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1374 transitions. [2024-11-09 10:15:16,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:16,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1374 transitions. [2024-11-09 10:15:16,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 10:15:16,159 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:16,159 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:15:16,166 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-09 10:15:16,364 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-09 10:15:16,364 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:15:16,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:16,365 INFO L85 PathProgramCache]: Analyzing trace with hash 103689706, now seen corresponding path program 1 times [2024-11-09 10:15:16,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:15:16,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255525711] [2024-11-09 10:15:16,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:16,365 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-09 10:15:16,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:15:16,368 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-09 10:15:16,371 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-09 10:15:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:16,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:15:16,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:16,619 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-09 10:15:16,619 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:15:16,620 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:15:16,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255525711] [2024-11-09 10:15:16,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255525711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:16,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:16,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:15:16,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912889123] [2024-11-09 10:15:16,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:16,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:15:16,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:15:16,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:15:16,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:15:16,621 INFO L87 Difference]: Start difference. First operand 1142 states and 1374 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:16,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:16,661 INFO L93 Difference]: Finished difference Result 1130 states and 1354 transitions. [2024-11-09 10:15:16,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:15:16,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-09 10:15:16,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:16,665 INFO L225 Difference]: With dead ends: 1130 [2024-11-09 10:15:16,665 INFO L226 Difference]: Without dead ends: 1130 [2024-11-09 10:15:16,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:15:16,666 INFO L432 NwaCegarLoop]: 923 mSDtfsCounter, 21 mSDsluCounter, 1815 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2738 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:16,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2738 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:15:16,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1130 states. [2024-11-09 10:15:16,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1130 to 1130. [2024-11-09 10:15:16,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 726 states have (on average 1.8236914600550964) internal successors, (1324), 1112 states have internal predecessors, (1324), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 10:15:16,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1354 transitions. [2024-11-09 10:15:16,679 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1354 transitions. Word has length 55 [2024-11-09 10:15:16,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:16,679 INFO L471 AbstractCegarLoop]: Abstraction has 1130 states and 1354 transitions. [2024-11-09 10:15:16,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:16,680 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1354 transitions. [2024-11-09 10:15:16,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 10:15:16,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:16,681 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:15:16,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-09 10:15:16,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:15:16,882 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:15:16,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:16,882 INFO L85 PathProgramCache]: Analyzing trace with hash -636164170, now seen corresponding path program 1 times [2024-11-09 10:15:16,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:15:16,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493226279] [2024-11-09 10:15:16,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:16,883 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-09 10:15:16,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:15:16,886 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 10:15:16,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 10:15:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:17,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 10:15:17,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:17,346 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-09 10:15:17,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2024-11-09 10:15:17,408 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-09 10:15:17,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2024-11-09 10:15:17,843 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-09 10:15:17,845 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:15:17,845 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:15:17,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493226279] [2024-11-09 10:15:17,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493226279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:17,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:17,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:15:17,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158000833] [2024-11-09 10:15:17,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:17,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:15:17,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:15:17,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:15:17,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:15:17,846 INFO L87 Difference]: Start difference. First operand 1130 states and 1354 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:20,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:20,164 INFO L93 Difference]: Finished difference Result 2053 states and 2462 transitions. [2024-11-09 10:15:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:15:20,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-09 10:15:20,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:20,169 INFO L225 Difference]: With dead ends: 2053 [2024-11-09 10:15:20,169 INFO L226 Difference]: Without dead ends: 2053 [2024-11-09 10:15:20,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:15:20,170 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 793 mSDsluCounter, 1556 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 793 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 1630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:20,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [793 Valid, 2138 Invalid, 1630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 10:15:20,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2053 states. [2024-11-09 10:15:20,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2053 to 1561. [2024-11-09 10:15:20,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 1142 states have (on average 1.816987740805604) internal successors, (2075), 1531 states have internal predecessors, (2075), 29 states have call successors, (29), 9 states have call predecessors, (29), 7 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-09 10:15:20,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2129 transitions. [2024-11-09 10:15:20,185 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2129 transitions. Word has length 63 [2024-11-09 10:15:20,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:20,185 INFO L471 AbstractCegarLoop]: Abstraction has 1561 states and 2129 transitions. [2024-11-09 10:15:20,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:20,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2129 transitions. [2024-11-09 10:15:20,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-09 10:15:20,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:20,187 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:15:20,196 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 (15)] Ended with exit code 0 [2024-11-09 10:15:20,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:15:20,388 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:15:20,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:20,388 INFO L85 PathProgramCache]: Analyzing trace with hash -636164169, now seen corresponding path program 1 times [2024-11-09 10:15:20,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:15:20,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [844628410] [2024-11-09 10:15:20,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:20,389 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-09 10:15:20,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:15:20,390 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-09 10:15:20,393 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-09 10:15:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:20,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-09 10:15:20,757 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:20,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:15:20,799 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-09 10:15:20,852 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 10:15:20,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 10:15:21,339 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-09 10:15:21,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:15:21,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:15:21,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [844628410] [2024-11-09 10:15:21,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [844628410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:21,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:21,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:15:21,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893776944] [2024-11-09 10:15:21,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:21,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:15:21,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:15:21,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:15:21,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:15:21,345 INFO L87 Difference]: Start difference. First operand 1561 states and 2129 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:23,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:23,068 INFO L93 Difference]: Finished difference Result 1566 states and 2135 transitions. [2024-11-09 10:15:23,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:15:23,071 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-09 10:15:23,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:23,079 INFO L225 Difference]: With dead ends: 1566 [2024-11-09 10:15:23,080 INFO L226 Difference]: Without dead ends: 1566 [2024-11-09 10:15:23,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:15:23,080 INFO L432 NwaCegarLoop]: 918 mSDtfsCounter, 58 mSDsluCounter, 1029 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:23,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 1947 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 10:15:23,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2024-11-09 10:15:23,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1566. [2024-11-09 10:15:23,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 1146 states have (on average 1.8141361256544504) internal successors, (2079), 1535 states have internal predecessors, (2079), 30 states have call successors, (30), 10 states have call predecessors, (30), 7 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 10:15:23,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 2135 transitions. [2024-11-09 10:15:23,111 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 2135 transitions. Word has length 63 [2024-11-09 10:15:23,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:23,111 INFO L471 AbstractCegarLoop]: Abstraction has 1566 states and 2135 transitions. [2024-11-09 10:15:23,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 2135 transitions. [2024-11-09 10:15:23,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-09 10:15:23,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:23,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:15:23,122 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-09 10:15:23,316 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 [2024-11-09 10:15:23,316 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:15:23,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:23,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1657745720, now seen corresponding path program 1 times [2024-11-09 10:15:23,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:15:23,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934903977] [2024-11-09 10:15:23,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:23,317 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-09 10:15:23,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:15:23,319 INFO L229 MonitoredProcess]: Starting monitored process 17 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-09 10:15:23,320 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 (17)] Waiting until timeout for monitored process [2024-11-09 10:15:23,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:23,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:15:23,563 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:23,589 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-09 10:15:23,589 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:15:23,589 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:15:23,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934903977] [2024-11-09 10:15:23,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [934903977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:23,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:23,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:15:23,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681918645] [2024-11-09 10:15:23,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:23,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:15:23,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:15:23,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:15:23,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:15:23,592 INFO L87 Difference]: Start difference. First operand 1566 states and 2135 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:23,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:23,679 INFO L93 Difference]: Finished difference Result 1592 states and 2162 transitions. [2024-11-09 10:15:23,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:15:23,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-11-09 10:15:23,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:23,688 INFO L225 Difference]: With dead ends: 1592 [2024-11-09 10:15:23,688 INFO L226 Difference]: Without dead ends: 1592 [2024-11-09 10:15:23,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:15:23,689 INFO L432 NwaCegarLoop]: 933 mSDtfsCounter, 15 mSDsluCounter, 3727 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 4660 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:23,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 4660 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:15:23,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1592 states. [2024-11-09 10:15:23,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1592 to 1590. [2024-11-09 10:15:23,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1164 states have (on average 1.8058419243986255) internal successors, (2102), 1555 states have internal predecessors, (2102), 32 states have call successors, (32), 14 states have call predecessors, (32), 11 states have return successors, (28), 24 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 10:15:23,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 2162 transitions. [2024-11-09 10:15:23,720 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 2162 transitions. Word has length 71 [2024-11-09 10:15:23,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:23,721 INFO L471 AbstractCegarLoop]: Abstraction has 1590 states and 2162 transitions. [2024-11-09 10:15:23,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:15:23,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2162 transitions. [2024-11-09 10:15:23,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 10:15:23,721 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:23,722 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:15:23,729 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 (17)] Forceful destruction successful, exit code 0 [2024-11-09 10:15:23,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-09 10:15:23,923 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:15:23,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:23,923 INFO L85 PathProgramCache]: Analyzing trace with hash 949549232, now seen corresponding path program 1 times [2024-11-09 10:15:23,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:15:23,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252970152] [2024-11-09 10:15:23,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:23,924 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-09 10:15:23,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:15:23,926 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-09 10:15:23,927 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-09 10:15:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:24,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:15:24,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:24,276 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-09 10:15:24,277 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:15:24,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:15:24,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252970152] [2024-11-09 10:15:24,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252970152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:24,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:24,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:15:24,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416124356] [2024-11-09 10:15:24,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:24,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:15:24,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:15:24,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:15:24,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:15:24,279 INFO L87 Difference]: Start difference. First operand 1590 states and 2162 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 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-09 10:15:24,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:24,446 INFO L93 Difference]: Finished difference Result 1602 states and 2176 transitions. [2024-11-09 10:15:24,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:15:24,447 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 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 69 [2024-11-09 10:15:24,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:24,459 INFO L225 Difference]: With dead ends: 1602 [2024-11-09 10:15:24,459 INFO L226 Difference]: Without dead ends: 1602 [2024-11-09 10:15:24,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 10:15:24,459 INFO L432 NwaCegarLoop]: 917 mSDtfsCounter, 22 mSDsluCounter, 3574 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 4491 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:24,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 4491 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:15:24,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2024-11-09 10:15:24,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1593. [2024-11-09 10:15:24,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1166 states have (on average 1.804459691252144) internal successors, (2104), 1557 states have internal predecessors, (2104), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-11-09 10:15:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 2165 transitions. [2024-11-09 10:15:24,483 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 2165 transitions. Word has length 69 [2024-11-09 10:15:24,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:24,483 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 2165 transitions. [2024-11-09 10:15:24,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 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-09 10:15:24,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2165 transitions. [2024-11-09 10:15:24,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 10:15:24,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:24,484 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:15:24,494 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 (18)] Forceful destruction successful, exit code 0 [2024-11-09 10:15:24,688 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-09 10:15:24,689 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:15:24,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:24,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1301141160, now seen corresponding path program 1 times [2024-11-09 10:15:24,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:15:24,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625025925] [2024-11-09 10:15:24,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:24,690 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-09 10:15:24,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:15:24,693 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-09 10:15:24,695 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-09 10:15:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:25,092 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:15:25,094 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:25,098 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-09 10:15:25,209 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#valid)| |alt_malloc_#res.base| (_ bv1 1)) |c_#valid|)) is different from true [2024-11-09 10:15:25,222 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 10:15:25,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-09 10:15:25,230 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-09 10:15:25,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:15:25,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:15:25,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625025925] [2024-11-09 10:15:25,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [625025925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:25,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:25,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:15:25,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45207955] [2024-11-09 10:15:25,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:25,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:15:25,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:15:25,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:15:25,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-11-09 10:15:25,233 INFO L87 Difference]: Start difference. First operand 1593 states and 2165 transitions. Second operand has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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-09 10:15:27,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:27,278 INFO L93 Difference]: Finished difference Result 2014 states and 2710 transitions. [2024-11-09 10:15:27,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:15:27,278 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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 74 [2024-11-09 10:15:27,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:27,282 INFO L225 Difference]: With dead ends: 2014 [2024-11-09 10:15:27,283 INFO L226 Difference]: Without dead ends: 2014 [2024-11-09 10:15:27,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2024-11-09 10:15:27,283 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 771 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 2956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1326 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:27,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1651 Invalid, 2956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1609 Invalid, 0 Unknown, 1326 Unchecked, 2.0s Time] [2024-11-09 10:15:27,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2014 states. [2024-11-09 10:15:27,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2014 to 1592. [2024-11-09 10:15:27,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1592 states, 1166 states have (on average 1.8027444253859348) internal successors, (2102), 1556 states have internal predecessors, (2102), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-11-09 10:15:27,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1592 states to 1592 states and 2163 transitions. [2024-11-09 10:15:27,306 INFO L78 Accepts]: Start accepts. Automaton has 1592 states and 2163 transitions. Word has length 74 [2024-11-09 10:15:27,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:27,306 INFO L471 AbstractCegarLoop]: Abstraction has 1592 states and 2163 transitions. [2024-11-09 10:15:27,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.0) internal successors, (70), 6 states have internal predecessors, (70), 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-09 10:15:27,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1592 states and 2163 transitions. [2024-11-09 10:15:27,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-09 10:15:27,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:27,307 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:15:27,317 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-09 10:15:27,510 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-09 10:15:27,511 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:15:27,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:27,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1301141161, now seen corresponding path program 1 times [2024-11-09 10:15:27,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:15:27,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480519280] [2024-11-09 10:15:27,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:27,512 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-09 10:15:27,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:15:27,515 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-09 10:15:27,521 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-09 10:15:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:27,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 10:15:27,969 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:27,975 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-09 10:15:27,979 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-09 10:15:28,358 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |alt_malloc_#res.base| (select |c_#length| |alt_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |alt_malloc_#res.base|)))) is different from true [2024-11-09 10:15:28,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:15:28,373 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-09 10:15:28,383 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:15:28,385 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-09 10:15:28,398 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-09 10:15:28,399 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:15:28,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:15:28,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1480519280] [2024-11-09 10:15:28,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1480519280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:28,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:28,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 10:15:28,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109613863] [2024-11-09 10:15:28,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:28,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 10:15:28,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:15:28,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 10:15:28,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2024-11-09 10:15:28,401 INFO L87 Difference]: Start difference. First operand 1592 states and 2163 transitions. Second operand has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-09 10:15:32,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:32,286 INFO L93 Difference]: Finished difference Result 2690 states and 3619 transitions. [2024-11-09 10:15:32,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:15:32,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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 74 [2024-11-09 10:15:32,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:32,290 INFO L225 Difference]: With dead ends: 2690 [2024-11-09 10:15:32,290 INFO L226 Difference]: Without dead ends: 2690 [2024-11-09 10:15:32,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-11-09 10:15:32,291 INFO L432 NwaCegarLoop]: 995 mSDtfsCounter, 1477 mSDsluCounter, 1415 mSDsCounter, 0 mSdLazyCounter, 2964 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 2410 SdHoareTripleChecker+Invalid, 4800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1810 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:32,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1480 Valid, 2410 Invalid, 4800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2964 Invalid, 0 Unknown, 1810 Unchecked, 3.8s Time] [2024-11-09 10:15:32,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2024-11-09 10:15:32,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 1584. [2024-11-09 10:15:32,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1584 states, 1166 states have (on average 1.7890222984562607) internal successors, (2086), 1548 states have internal predecessors, (2086), 32 states have call successors, (32), 14 states have call predecessors, (32), 12 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-11-09 10:15:32,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1584 states to 1584 states and 2147 transitions. [2024-11-09 10:15:32,308 INFO L78 Accepts]: Start accepts. Automaton has 1584 states and 2147 transitions. Word has length 74 [2024-11-09 10:15:32,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:32,308 INFO L471 AbstractCegarLoop]: Abstraction has 1584 states and 2147 transitions. [2024-11-09 10:15:32,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-09 10:15:32,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1584 states and 2147 transitions. [2024-11-09 10:15:32,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-09 10:15:32,309 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:32,309 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:15:32,319 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 (20)] Ended with exit code 0 [2024-11-09 10:15:32,510 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-09 10:15:32,510 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:15:32,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:32,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2023437919, now seen corresponding path program 1 times [2024-11-09 10:15:32,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:15:32,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163065423] [2024-11-09 10:15:32,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:32,511 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-09 10:15:32,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:15:32,513 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-09 10:15:32,515 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-09 10:15:32,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:32,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 10:15:32,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:32,875 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-09 10:15:32,912 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 19 treesize of output 1 [2024-11-09 10:15:32,944 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 23 treesize of output 11 [2024-11-09 10:15:32,986 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-09 10:15:32,987 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:15:32,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:15:32,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163065423] [2024-11-09 10:15:32,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1163065423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:32,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:32,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 10:15:32,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230788377] [2024-11-09 10:15:32,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:32,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 10:15:32,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:15:32,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 10:15:32,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 10:15:32,989 INFO L87 Difference]: Start difference. First operand 1584 states and 2147 transitions. Second operand has 8 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:15:35,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:35,332 INFO L93 Difference]: Finished difference Result 1599 states and 2163 transitions. [2024-11-09 10:15:35,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:15:35,333 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 81 [2024-11-09 10:15:35,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:35,335 INFO L225 Difference]: With dead ends: 1599 [2024-11-09 10:15:35,335 INFO L226 Difference]: Without dead ends: 1599 [2024-11-09 10:15:35,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:15:35,336 INFO L432 NwaCegarLoop]: 920 mSDtfsCounter, 16 mSDsluCounter, 3080 mSDsCounter, 0 mSdLazyCounter, 2495 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 4000 SdHoareTripleChecker+Invalid, 2497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 2495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:35,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 4000 Invalid, 2497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 2495 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-09 10:15:35,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2024-11-09 10:15:35,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1598. [2024-11-09 10:15:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1178 states have (on average 1.7843803056027165) internal successors, (2102), 1560 states have internal predecessors, (2102), 32 states have call successors, (32), 16 states have call predecessors, (32), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-11-09 10:15:35,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2163 transitions. [2024-11-09 10:15:35,360 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2163 transitions. Word has length 81 [2024-11-09 10:15:35,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:35,361 INFO L471 AbstractCegarLoop]: Abstraction has 1598 states and 2163 transitions. [2024-11-09 10:15:35,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 10:15:35,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2163 transitions. [2024-11-09 10:15:35,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-09 10:15:35,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:35,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:15:35,374 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 (21)] Ended with exit code 0 [2024-11-09 10:15:35,563 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-09 10:15:35,563 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:15:35,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:35,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1697934027, now seen corresponding path program 1 times [2024-11-09 10:15:35,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:15:35,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109990625] [2024-11-09 10:15:35,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:35,564 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-09 10:15:35,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:15:35,566 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-09 10:15:35,567 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-09 10:15:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:35,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 10:15:35,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:35,939 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-09 10:15:35,973 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 19 treesize of output 1 [2024-11-09 10:15:35,982 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 13 treesize of output 9 [2024-11-09 10:15:36,020 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 21 treesize of output 9 [2024-11-09 10:15:36,082 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-09 10:15:36,083 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:15:36,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:15:36,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1109990625] [2024-11-09 10:15:36,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1109990625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:36,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:36,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 10:15:36,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135512089] [2024-11-09 10:15:36,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:36,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 10:15:36,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:15:36,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 10:15:36,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 10:15:36,085 INFO L87 Difference]: Start difference. First operand 1598 states and 2163 transitions. Second operand has 9 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:15:39,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:39,285 INFO L93 Difference]: Finished difference Result 1598 states and 2161 transitions. [2024-11-09 10:15:39,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:15:39,286 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 82 [2024-11-09 10:15:39,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:39,288 INFO L225 Difference]: With dead ends: 1598 [2024-11-09 10:15:39,288 INFO L226 Difference]: Without dead ends: 1598 [2024-11-09 10:15:39,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:15:39,293 INFO L432 NwaCegarLoop]: 916 mSDtfsCounter, 13 mSDsluCounter, 3837 mSDsCounter, 0 mSdLazyCounter, 2668 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4753 SdHoareTripleChecker+Invalid, 2669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:39,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4753 Invalid, 2669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2668 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-09 10:15:39,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1598 states. [2024-11-09 10:15:39,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1598 to 1598. [2024-11-09 10:15:39,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1178 states have (on average 1.7826825127334465) internal successors, (2100), 1560 states have internal predecessors, (2100), 32 states have call successors, (32), 16 states have call predecessors, (32), 14 states have return successors, (29), 24 states have call predecessors, (29), 28 states have call successors, (29) [2024-11-09 10:15:39,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2161 transitions. [2024-11-09 10:15:39,311 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2161 transitions. Word has length 82 [2024-11-09 10:15:39,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:39,311 INFO L471 AbstractCegarLoop]: Abstraction has 1598 states and 2161 transitions. [2024-11-09 10:15:39,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 10:15:39,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2161 transitions. [2024-11-09 10:15:39,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-09 10:15:39,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:39,312 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:15:39,321 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-09 10:15:39,516 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-09 10:15:39,517 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:15:39,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:39,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1028513902, now seen corresponding path program 1 times [2024-11-09 10:15:39,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:15:39,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426617520] [2024-11-09 10:15:39,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:39,519 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-09 10:15:39,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:15:39,520 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-09 10:15:39,522 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-09 10:15:39,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:39,848 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 10:15:39,850 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:39,876 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-09 10:15:39,876 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:15:39,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:15:39,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426617520] [2024-11-09 10:15:39,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426617520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:15:39,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:15:39,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:15:39,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211397466] [2024-11-09 10:15:39,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:15:39,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:15:39,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:15:39,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:15:39,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:15:39,878 INFO L87 Difference]: Start difference. First operand 1598 states and 2161 transitions. Second operand has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 10:15:39,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:39,924 INFO L93 Difference]: Finished difference Result 1614 states and 2179 transitions. [2024-11-09 10:15:39,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:15:39,925 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 89 [2024-11-09 10:15:39,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:39,927 INFO L225 Difference]: With dead ends: 1614 [2024-11-09 10:15:39,927 INFO L226 Difference]: Without dead ends: 1608 [2024-11-09 10:15:39,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:15:39,928 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 3 mSDsluCounter, 2759 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3684 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:39,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3684 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 10:15:39,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2024-11-09 10:15:39,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1608. [2024-11-09 10:15:39,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1608 states, 1186 states have (on average 1.779089376053963) internal successors, (2110), 1570 states have internal predecessors, (2110), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-11-09 10:15:39,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2173 transitions. [2024-11-09 10:15:39,942 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2173 transitions. Word has length 89 [2024-11-09 10:15:39,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:39,943 INFO L471 AbstractCegarLoop]: Abstraction has 1608 states and 2173 transitions. [2024-11-09 10:15:39,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.6) internal successors, (83), 5 states have internal predecessors, (83), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 10:15:39,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2173 transitions. [2024-11-09 10:15:39,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-09 10:15:39,943 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:39,943 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 10:15:39,951 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 (23)] Forceful destruction successful, exit code 0 [2024-11-09 10:15:40,144 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-09 10:15:40,144 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:15:40,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:40,158 INFO L85 PathProgramCache]: Analyzing trace with hash -659854572, now seen corresponding path program 1 times [2024-11-09 10:15:40,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:15:40,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2060313304] [2024-11-09 10:15:40,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:15:40,159 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-09 10:15:40,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:15:40,162 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-09 10:15:40,163 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-09 10:15:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:15:40,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 10:15:40,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:40,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:15:40,544 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:15:40,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:15:40,648 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:15:40,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2060313304] [2024-11-09 10:15:40,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2060313304] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:15:40,648 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:15:40,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-09 10:15:40,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365932558] [2024-11-09 10:15:40,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:15:40,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 10:15:40,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:15:40,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 10:15:40,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-09 10:15:40,649 INFO L87 Difference]: Start difference. First operand 1608 states and 2173 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 10:15:40,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:40,810 INFO L93 Difference]: Finished difference Result 1634 states and 2203 transitions. [2024-11-09 10:15:40,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 10:15:40,811 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 90 [2024-11-09 10:15:40,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:40,813 INFO L225 Difference]: With dead ends: 1634 [2024-11-09 10:15:40,813 INFO L226 Difference]: Without dead ends: 1622 [2024-11-09 10:15:40,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-11-09 10:15:40,814 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 21 mSDsluCounter, 2763 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3688 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:40,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3688 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 10:15:40,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2024-11-09 10:15:40,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1616. [2024-11-09 10:15:40,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1616 states, 1194 states have (on average 1.7755443886097153) internal successors, (2120), 1578 states have internal predecessors, (2120), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-11-09 10:15:40,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 2183 transitions. [2024-11-09 10:15:40,830 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 2183 transitions. Word has length 90 [2024-11-09 10:15:40,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:40,831 INFO L471 AbstractCegarLoop]: Abstraction has 1616 states and 2183 transitions. [2024-11-09 10:15:40,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 10 states have internal predecessors, (91), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 10:15:40,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 2183 transitions. [2024-11-09 10:15:40,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 10:15:40,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:40,832 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:15:40,840 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-09 10:15:41,032 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 [2024-11-09 10:15:41,032 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:15:41,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:41,033 INFO L85 PathProgramCache]: Analyzing trace with hash -307340818, now seen corresponding path program 2 times [2024-11-09 10:15:41,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:15:41,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [692272098] [2024-11-09 10:15:41,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:15:41,034 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-09 10:15:41,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:15:41,036 INFO L229 MonitoredProcess]: Starting monitored process 25 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-09 10:15:41,038 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 (25)] Waiting until timeout for monitored process [2024-11-09 10:15:41,849 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:15:41,849 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:15:41,870 INFO L255 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 10:15:41,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:41,960 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:15:41,960 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:15:42,211 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:15:42,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:15:42,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [692272098] [2024-11-09 10:15:42,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [692272098] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:15:42,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:15:42,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-09 10:15:42,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507212735] [2024-11-09 10:15:42,213 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:15:42,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 10:15:42,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:15:42,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 10:15:42,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-09 10:15:42,214 INFO L87 Difference]: Start difference. First operand 1616 states and 2183 transitions. Second operand has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 10:15:42,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:42,690 INFO L93 Difference]: Finished difference Result 1652 states and 2233 transitions. [2024-11-09 10:15:42,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 10:15:42,691 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 93 [2024-11-09 10:15:42,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:42,693 INFO L225 Difference]: With dead ends: 1652 [2024-11-09 10:15:42,693 INFO L226 Difference]: Without dead ends: 1640 [2024-11-09 10:15:42,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2024-11-09 10:15:42,694 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 36 mSDsluCounter, 7361 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 8286 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:42,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 8286 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 10:15:42,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2024-11-09 10:15:42,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1634. [2024-11-09 10:15:42,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1634 states, 1212 states have (on average 1.768976897689769) internal successors, (2144), 1596 states have internal predecessors, (2144), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-11-09 10:15:42,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1634 states to 1634 states and 2207 transitions. [2024-11-09 10:15:42,710 INFO L78 Accepts]: Start accepts. Automaton has 1634 states and 2207 transitions. Word has length 93 [2024-11-09 10:15:42,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:42,711 INFO L471 AbstractCegarLoop]: Abstraction has 1634 states and 2207 transitions. [2024-11-09 10:15:42,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 10:15:42,712 INFO L276 IsEmpty]: Start isEmpty. Operand 1634 states and 2207 transitions. [2024-11-09 10:15:42,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 10:15:42,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:42,712 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:15:42,723 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 (25)] Forceful destruction successful, exit code 0 [2024-11-09 10:15:42,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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-09 10:15:42,914 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:15:42,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:42,915 INFO L85 PathProgramCache]: Analyzing trace with hash -257513426, now seen corresponding path program 3 times [2024-11-09 10:15:42,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:15:42,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398761329] [2024-11-09 10:15:42,915 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 10:15:42,916 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-09 10:15:42,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:15:42,918 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-09 10:15:42,919 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-09 10:15:43,914 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-09 10:15:43,914 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:15:43,933 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 10:15:43,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:44,135 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:15:44,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:15:44,662 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:15:44,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:15:44,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398761329] [2024-11-09 10:15:44,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398761329] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:15:44,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:15:44,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-11-09 10:15:44,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570904670] [2024-11-09 10:15:44,663 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:15:44,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 10:15:44,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:15:44,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 10:15:44,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2024-11-09 10:15:44,665 INFO L87 Difference]: Start difference. First operand 1634 states and 2207 transitions. Second operand has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 10:15:46,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:46,579 INFO L93 Difference]: Finished difference Result 1688 states and 2291 transitions. [2024-11-09 10:15:46,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-09 10:15:46,580 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 99 [2024-11-09 10:15:46,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:46,584 INFO L225 Difference]: With dead ends: 1688 [2024-11-09 10:15:46,584 INFO L226 Difference]: Without dead ends: 1670 [2024-11-09 10:15:46,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=854, Invalid=1696, Unknown=0, NotChecked=0, Total=2550 [2024-11-09 10:15:46,585 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 43 mSDsluCounter, 11960 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 12885 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:46,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 12885 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 10:15:46,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1670 states. [2024-11-09 10:15:46,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1670 to 1670. [2024-11-09 10:15:46,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1670 states, 1248 states have (on average 1.7548076923076923) internal successors, (2190), 1632 states have internal predecessors, (2190), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-11-09 10:15:46,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1670 states to 1670 states and 2253 transitions. [2024-11-09 10:15:46,608 INFO L78 Accepts]: Start accepts. Automaton has 1670 states and 2253 transitions. Word has length 99 [2024-11-09 10:15:46,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:46,609 INFO L471 AbstractCegarLoop]: Abstraction has 1670 states and 2253 transitions. [2024-11-09 10:15:46,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.892857142857143) internal successors, (109), 28 states have internal predecessors, (109), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 10:15:46,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1670 states and 2253 transitions. [2024-11-09 10:15:46,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-09 10:15:46,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:46,610 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:15:46,628 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-09 10:15:46,811 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-09 10:15:46,811 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:15:46,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:46,812 INFO L85 PathProgramCache]: Analyzing trace with hash 351286446, now seen corresponding path program 4 times [2024-11-09 10:15:46,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:15:46,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991589304] [2024-11-09 10:15:46,812 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 10:15:46,813 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-09 10:15:46,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:15:46,816 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-09 10:15:46,817 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-09 10:15:47,638 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 10:15:47,638 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:15:47,659 INFO L255 TraceCheckSpWp]: Trace formula consists of 685 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 10:15:47,661 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:48,128 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:15:48,128 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:15:49,493 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:15:49,493 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:15:49,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991589304] [2024-11-09 10:15:49,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991589304] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:15:49,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:15:49,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-09 10:15:49,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322418638] [2024-11-09 10:15:49,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:15:49,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-09 10:15:49,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:15:49,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-09 10:15:49,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2024-11-09 10:15:49,496 INFO L87 Difference]: Start difference. First operand 1670 states and 2253 transitions. Second operand has 52 states, 52 states have (on average 2.5576923076923075) internal successors, (133), 52 states have internal predecessors, (133), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 10:15:58,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 10:15:58,036 INFO L93 Difference]: Finished difference Result 1756 states and 2403 transitions. [2024-11-09 10:15:58,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-09 10:15:58,037 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.5576923076923075) internal successors, (133), 52 states have internal predecessors, (133), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 111 [2024-11-09 10:15:58,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 10:15:58,040 INFO L225 Difference]: With dead ends: 1756 [2024-11-09 10:15:58,040 INFO L226 Difference]: Without dead ends: 1744 [2024-11-09 10:15:58,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2955, Invalid=6357, Unknown=0, NotChecked=0, Total=9312 [2024-11-09 10:15:58,044 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 101 mSDsluCounter, 22101 mSDsCounter, 0 mSdLazyCounter, 1906 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 23026 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1906 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-09 10:15:58,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 23026 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1906 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-09 10:15:58,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2024-11-09 10:15:58,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1738. [2024-11-09 10:15:58,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1738 states, 1316 states have (on average 1.7340425531914894) internal successors, (2282), 1700 states have internal predecessors, (2282), 32 states have call successors, (32), 16 states have call predecessors, (32), 16 states have return successors, (31), 24 states have call predecessors, (31), 28 states have call successors, (31) [2024-11-09 10:15:58,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1738 states to 1738 states and 2345 transitions. [2024-11-09 10:15:58,062 INFO L78 Accepts]: Start accepts. Automaton has 1738 states and 2345 transitions. Word has length 111 [2024-11-09 10:15:58,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 10:15:58,062 INFO L471 AbstractCegarLoop]: Abstraction has 1738 states and 2345 transitions. [2024-11-09 10:15:58,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.5576923076923075) internal successors, (133), 52 states have internal predecessors, (133), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 10:15:58,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1738 states and 2345 transitions. [2024-11-09 10:15:58,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-09 10:15:58,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 10:15:58,063 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:15:58,080 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 (27)] Ended with exit code 0 [2024-11-09 10:15:58,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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-09 10:15:58,264 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 519 more)] === [2024-11-09 10:15:58,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:15:58,265 INFO L85 PathProgramCache]: Analyzing trace with hash 2042747118, now seen corresponding path program 5 times [2024-11-09 10:15:58,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:15:58,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700351713] [2024-11-09 10:15:58,266 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 10:15:58,267 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-09 10:15:58,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:15:58,269 INFO L229 MonitoredProcess]: Starting monitored process 28 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-09 10:15:58,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-09 10:15:59,525 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-09 10:15:59,526 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:15:59,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-09 10:15:59,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:15:59,571 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-09 10:15:59,740 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-09 10:15:59,740 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 19 treesize of output 27 [2024-11-09 10:15:59,767 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 19 treesize of output 1 [2024-11-09 10:15:59,853 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 24 treesize of output 12 [2024-11-09 10:16:00,942 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 10:16:00,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-09 10:16:00,974 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 33 treesize of output 15 [2024-11-09 10:16:01,004 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 903 trivial. 0 not checked. [2024-11-09 10:16:01,004 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:16:01,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:16:01,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700351713] [2024-11-09 10:16:01,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [700351713] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:16:01,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2000254608] [2024-11-09 10:16:01,369 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 10:16:01,370 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 10:16:01,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 10:16:01,372 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 10:16:01,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process