./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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_BER_test8-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fe37ed55d149c65fede95413b0b499314c3ede2b9eb9a49f03115ea64cafc68c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:15:08,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:15:08,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-09 07:15:08,274 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:15:08,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:15:08,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:15:08,299 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:15:08,299 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:15:08,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:15:08,301 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:15:08,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:15:08,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:15:08,302 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:15:08,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:15:08,304 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:15:08,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:15:08,305 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:15:08,305 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:15:08,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:15:08,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:15:08,306 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:15:08,309 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:15:08,309 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:15:08,310 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:15:08,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:15:08,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:15:08,310 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:15:08,311 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:15:08,311 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:15:08,311 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:15:08,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:15:08,311 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:15:08,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:15:08,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:15:08,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:15:08,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:15:08,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:15:08,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:15:08,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:15:08,313 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:15:08,314 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:15:08,315 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:15:08,315 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:15:08,315 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:15:08,316 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:15:08,316 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-memcleanup) ) 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 -> fe37ed55d149c65fede95413b0b499314c3ede2b9eb9a49f03115ea64cafc68c [2024-11-09 07:15:08,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:15:08,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:15:08,590 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:15:08,591 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:15:08,592 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:15:08,593 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-2.i [2024-11-09 07:15:10,212 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:15:10,436 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:15:10,439 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-2.i [2024-11-09 07:15:10,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2e3e6607/1fbdd7cda3e64418b386fcaf664e4e8c/FLAG2bb13441b [2024-11-09 07:15:10,761 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c2e3e6607/1fbdd7cda3e64418b386fcaf664e4e8c [2024-11-09 07:15:10,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:15:10,764 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:15:10,766 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:15:10,766 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:15:10,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:15:10,771 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:15:10" (1/1) ... [2024-11-09 07:15:10,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@153e6a6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:10, skipping insertion in model container [2024-11-09 07:15:10,772 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:15:10" (1/1) ... [2024-11-09 07:15:10,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:15:11,146 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 07:15:11,167 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 07:15:11,171 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 07:15:11,173 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 07:15:11,178 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 07:15:11,203 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 07:15:11,204 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 07:15:11,205 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 07:15:11,206 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 07:15:11,208 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 07:15:11,213 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 07:15:11,214 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 07:15:11,215 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 07:15:11,224 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 07:15:11,227 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 07:15:11,228 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 07:15:11,229 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 07:15:11,230 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 07:15:11,233 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 07:15:11,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:15:11,256 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 07:15:11,257 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@251b50d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:11, skipping insertion in model container [2024-11-09 07:15:11,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:15:11,257 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 07:15:11,259 INFO L158 Benchmark]: Toolchain (without parser) took 494.01ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 84.6MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 07:15:11,259 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 167.8MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:15:11,260 INFO L158 Benchmark]: CACSL2BoogieTranslator took 491.73ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 84.6MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 07:15:11,261 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.22ms. Allocated memory is still 167.8MB. Free memory is still 130.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 491.73ms. Allocated memory is still 167.8MB. Free memory was 108.8MB in the beginning and 84.6MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 778]: 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_BER_test8-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fe37ed55d149c65fede95413b0b499314c3ede2b9eb9a49f03115ea64cafc68c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:15:13,408 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:15:13,513 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-09 07:15:13,522 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:15:13,523 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:15:13,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:15:13,567 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:15:13,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:15:13,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:15:13,570 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:15:13,570 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:15:13,571 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:15:13,571 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:15:13,572 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:15:13,572 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:15:13,572 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:15:13,573 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:15:13,573 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:15:13,576 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:15:13,576 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:15:13,577 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:15:13,581 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:15:13,581 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:15:13,585 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:15:13,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:15:13,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:15:13,586 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:15:13,586 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 07:15:13,586 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:15:13,587 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 07:15:13,587 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:15:13,587 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:15:13,587 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:15:13,588 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:15:13,588 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:15:13,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:15:13,589 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:15:13,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:15:13,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:15:13,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:15:13,592 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:15:13,592 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 07:15:13,592 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 07:15:13,593 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:15:13,593 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:15:13,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:15:13,594 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:15:13,594 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-memcleanup) ) 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 -> fe37ed55d149c65fede95413b0b499314c3ede2b9eb9a49f03115ea64cafc68c [2024-11-09 07:15:13,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:15:14,022 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:15:14,024 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:15:14,025 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:15:14,027 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:15:14,029 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-2.i [2024-11-09 07:15:15,627 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:15:16,035 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:15:16,037 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test8-2.i [2024-11-09 07:15:16,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bbf59be1/08a1c60d7e8c480aa605b57bd26eb140/FLAGad6725c8b [2024-11-09 07:15:16,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7bbf59be1/08a1c60d7e8c480aa605b57bd26eb140 [2024-11-09 07:15:16,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:15:16,077 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:15:16,078 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:15:16,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:15:16,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:15:16,084 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:15:16" (1/1) ... [2024-11-09 07:15:16,084 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@155a6640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:16, skipping insertion in model container [2024-11-09 07:15:16,085 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:15:16" (1/1) ... [2024-11-09 07:15:16,142 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:15:16,471 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 07:15:16,503 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 07:15:16,510 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 07:15:16,515 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 07:15:16,525 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 07:15:16,551 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 07:15:16,551 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 07:15:16,553 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 07:15:16,553 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 07:15:16,555 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 07:15:16,556 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 07:15:16,557 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 07:15:16,558 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 07:15:16,561 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 07:15:16,562 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 07:15:16,563 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 07:15:16,563 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 07:15:16,564 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 07:15:16,567 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 07:15:16,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:15:16,593 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 07:15:16,599 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:15:16,614 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 07:15:16,623 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 07:15:16,625 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 07:15:16,626 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 07:15:16,630 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 07:15:16,644 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 07:15:16,645 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 07:15:16,646 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 07:15:16,646 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 07:15:16,648 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 07:15:16,649 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 07:15:16,649 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 07:15:16,650 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 07:15:16,652 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 07:15:16,653 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 07:15:16,654 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 07:15:16,654 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 07:15:16,655 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 07:15:16,663 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 07:15:16,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:15:16,674 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:15:16,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:15:16,826 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:15:16,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:16 WrapperNode [2024-11-09 07:15:16,827 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:15:16,828 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:15:16,828 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:15:16,828 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:15:16,835 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:16" (1/1) ... [2024-11-09 07:15:16,873 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:16" (1/1) ... [2024-11-09 07:15:16,959 INFO L138 Inliner]: procedures = 180, calls = 342, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1176 [2024-11-09 07:15:16,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:15:16,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:15:16,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:15:16,960 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:15:16,983 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:16" (1/1) ... [2024-11-09 07:15:16,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:16" (1/1) ... [2024-11-09 07:15:16,995 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:16" (1/1) ... [2024-11-09 07:15:17,070 INFO L175 MemorySlicer]: Split 304 memory accesses to 3 slices as follows [2, 268, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2024-11-09 07:15:17,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:16" (1/1) ... [2024-11-09 07:15:17,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:16" (1/1) ... [2024-11-09 07:15:17,134 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:16" (1/1) ... [2024-11-09 07:15:17,147 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:16" (1/1) ... [2024-11-09 07:15:17,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:16" (1/1) ... [2024-11-09 07:15:17,160 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:16" (1/1) ... [2024-11-09 07:15:17,168 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:15:17,169 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:15:17,169 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:15:17,169 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:15:17,170 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:16" (1/1) ... [2024-11-09 07:15:17,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:15:17,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:15:17,200 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 07:15:17,206 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 07:15:17,248 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 07:15:17,249 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 07:15:17,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 07:15:17,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 07:15:17,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 07:15:17,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 07:15:17,250 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 07:15:17,251 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 07:15:17,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 07:15:17,251 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 07:15:17,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 07:15:17,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 07:15:17,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 07:15:17,251 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 07:15:17,251 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 07:15:17,251 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 07:15:17,251 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2024-11-09 07:15:17,252 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2024-11-09 07:15:17,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:15:17,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:15:17,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:15:17,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:15:17,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 07:15:17,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:15:17,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:15:17,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:15:17,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 07:15:17,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:15:17,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 07:15:17,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 07:15:17,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 07:15:17,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 07:15:17,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 07:15:17,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 07:15:17,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:15:17,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:15:17,465 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:15:17,467 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:15:24,912 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-11-09 07:15:24,912 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:15:24,932 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:15:24,934 INFO L316 CfgBuilder]: Removed 71 assume(true) statements. [2024-11-09 07:15:24,934 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:15:24 BoogieIcfgContainer [2024-11-09 07:15:24,934 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:15:24,936 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:15:24,937 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:15:24,940 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:15:24,940 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:15:16" (1/3) ... [2024-11-09 07:15:24,940 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f5c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:15:24, skipping insertion in model container [2024-11-09 07:15:24,941 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:15:16" (2/3) ... [2024-11-09 07:15:24,942 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f5c41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:15:24, skipping insertion in model container [2024-11-09 07:15:24,942 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:15:24" (3/3) ... [2024-11-09 07:15:24,943 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test8-2.i [2024-11-09 07:15:24,957 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:15:24,957 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 07:15:25,004 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:15:25,012 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;@7b9693d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:15:25,012 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 07:15:25,022 INFO L276 IsEmpty]: Start isEmpty. Operand has 268 states, 239 states have (on average 1.6652719665271967) internal successors, (398), 258 states have internal predecessors, (398), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-09 07:15:25,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:15:25,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:25,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:15:25,032 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:15:25,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:25,039 INFO L85 PathProgramCache]: Analyzing trace with hash 901390748, now seen corresponding path program 1 times [2024-11-09 07:15:25,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:15:25,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461965167] [2024-11-09 07:15:25,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:25,054 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 07:15:25,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:15:25,056 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 07:15:25,077 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 07:15:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:25,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 07:15:25,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:25,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:15:25,295 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:25,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:15:25,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461965167] [2024-11-09 07:15:25,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461965167] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:25,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:25,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:15:25,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639340577] [2024-11-09 07:15:25,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:25,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 07:15:25,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:15:25,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 07:15:25,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:15:25,325 INFO L87 Difference]: Start difference. First operand has 268 states, 239 states have (on average 1.6652719665271967) internal successors, (398), 258 states have internal predecessors, (398), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 07:15:25,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:25,352 INFO L93 Difference]: Finished difference Result 266 states and 362 transitions. [2024-11-09 07:15:25,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 07:15:25,354 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 11 [2024-11-09 07:15:25,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:25,362 INFO L225 Difference]: With dead ends: 266 [2024-11-09 07:15:25,362 INFO L226 Difference]: Without dead ends: 264 [2024-11-09 07:15:25,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:15:25,366 INFO L432 NwaCegarLoop]: 362 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:25,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:15:25,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-09 07:15:25,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-11-09 07:15:25,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 237 states have (on average 1.3417721518987342) internal successors, (318), 254 states have internal predecessors, (318), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 07:15:25,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 360 transitions. [2024-11-09 07:15:25,409 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 360 transitions. Word has length 11 [2024-11-09 07:15:25,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:25,409 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 360 transitions. [2024-11-09 07:15:25,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 07:15:25,410 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 360 transitions. [2024-11-09 07:15:25,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 07:15:25,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:25,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:15:25,417 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 07:15:25,611 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 07:15:25,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:15:25,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:25,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1574241252, now seen corresponding path program 1 times [2024-11-09 07:15:25,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:15:25,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1006463606] [2024-11-09 07:15:25,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:25,613 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 07:15:25,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:15:25,620 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 07:15:25,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 (3)] Waiting until timeout for monitored process [2024-11-09 07:15:25,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:25,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:15:25,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:25,884 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:15:25,885 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:15:25,885 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:15:25,893 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 07:15:25,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:15:25,954 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 07:15:25,973 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 07:15:25,974 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:25,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:15:25,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1006463606] [2024-11-09 07:15:25,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1006463606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:25,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:25,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:15:25,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121802715] [2024-11-09 07:15:25,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:25,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:15:25,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:15:25,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:15:25,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:15:25,979 INFO L87 Difference]: Start difference. First operand 264 states and 360 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 07:15:26,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:26,478 INFO L93 Difference]: Finished difference Result 477 states and 641 transitions. [2024-11-09 07:15:26,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:15:26,479 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 07:15:26,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:26,481 INFO L225 Difference]: With dead ends: 477 [2024-11-09 07:15:26,481 INFO L226 Difference]: Without dead ends: 477 [2024-11-09 07:15:26,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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 07:15:26,482 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 267 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:26,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 1065 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:15:26,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-09 07:15:26,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 266. [2024-11-09 07:15:26,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 239 states have (on average 1.3389121338912133) internal successors, (320), 256 states have internal predecessors, (320), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 07:15:26,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 362 transitions. [2024-11-09 07:15:26,499 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 362 transitions. Word has length 13 [2024-11-09 07:15:26,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:26,500 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 362 transitions. [2024-11-09 07:15:26,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 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 07:15:26,500 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 362 transitions. [2024-11-09 07:15:26,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 07:15:26,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:26,503 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] [2024-11-09 07:15:26,511 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 07:15:26,707 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 07:15:26,708 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:15:26,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:26,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1418349862, now seen corresponding path program 1 times [2024-11-09 07:15:26,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:15:26,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930798964] [2024-11-09 07:15:26,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:26,710 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 07:15:26,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:15:26,713 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 07:15:26,730 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 07:15:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:27,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:15:27,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:27,110 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 07:15:27,110 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:27,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:15:27,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930798964] [2024-11-09 07:15:27,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930798964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:27,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:27,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:15:27,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042241071] [2024-11-09 07:15:27,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:27,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:15:27,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:15:27,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:15:27,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:15:27,115 INFO L87 Difference]: Start difference. First operand 266 states and 362 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 1 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 07:15:27,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:27,260 INFO L93 Difference]: Finished difference Result 269 states and 357 transitions. [2024-11-09 07:15:27,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:15:27,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 1 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 67 [2024-11-09 07:15:27,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:27,262 INFO L225 Difference]: With dead ends: 269 [2024-11-09 07:15:27,262 INFO L226 Difference]: Without dead ends: 269 [2024-11-09 07:15:27,262 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 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 07:15:27,263 INFO L432 NwaCegarLoop]: 330 mSDtfsCounter, 30 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:27,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 971 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:15:27,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-09 07:15:27,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-09 07:15:27,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 242 states have (on average 1.3016528925619835) internal successors, (315), 259 states have internal predecessors, (315), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 07:15:27,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 357 transitions. [2024-11-09 07:15:27,273 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 357 transitions. Word has length 67 [2024-11-09 07:15:27,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:27,274 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 357 transitions. [2024-11-09 07:15:27,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (3), 1 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 07:15:27,274 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 357 transitions. [2024-11-09 07:15:27,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 07:15:27,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:27,275 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] [2024-11-09 07:15:27,286 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 07:15:27,476 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 07:15:27,477 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:15:27,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:27,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1396463258, now seen corresponding path program 1 times [2024-11-09 07:15:27,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:15:27,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048765076] [2024-11-09 07:15:27,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:27,479 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 07:15:27,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:15:27,481 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 07:15:27,484 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 07:15:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:27,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:15:27,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:27,962 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 07:15:27,962 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:27,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:15:27,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1048765076] [2024-11-09 07:15:27,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1048765076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:27,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:27,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:15:27,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254726727] [2024-11-09 07:15:27,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:27,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:15:27,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:15:27,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:15:27,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:15:27,965 INFO L87 Difference]: Start difference. First operand 269 states and 357 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (3), 1 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 07:15:28,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:28,051 INFO L93 Difference]: Finished difference Result 263 states and 347 transitions. [2024-11-09 07:15:28,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:15:28,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (3), 1 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 67 [2024-11-09 07:15:28,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:28,053 INFO L225 Difference]: With dead ends: 263 [2024-11-09 07:15:28,053 INFO L226 Difference]: Without dead ends: 263 [2024-11-09 07:15:28,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:15:28,054 INFO L432 NwaCegarLoop]: 329 mSDtfsCounter, 0 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:28,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 968 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:15:28,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-09 07:15:28,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2024-11-09 07:15:28,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 236 states have (on average 1.2923728813559323) internal successors, (305), 253 states have internal predecessors, (305), 22 states have call successors, (22), 4 states have call predecessors, (22), 3 states have return successors, (20), 6 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-09 07:15:28,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 347 transitions. [2024-11-09 07:15:28,086 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 347 transitions. Word has length 67 [2024-11-09 07:15:28,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:28,087 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 347 transitions. [2024-11-09 07:15:28,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (3), 1 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 07:15:28,087 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 347 transitions. [2024-11-09 07:15:28,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-09 07:15:28,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:28,089 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] [2024-11-09 07:15:28,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-09 07:15:28,289 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 07:15:28,290 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:15:28,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:28,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1790830044, now seen corresponding path program 1 times [2024-11-09 07:15:28,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:15:28,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435296478] [2024-11-09 07:15:28,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:28,292 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 07:15:28,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:15:28,296 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 07:15:28,297 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 07:15:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:28,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:15:28,629 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:28,871 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 07:15:28,875 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:28,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:15:28,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435296478] [2024-11-09 07:15:28,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435296478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:28,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:28,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:15:28,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721507080] [2024-11-09 07:15:28,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:28,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:15:28,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:15:28,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:15:28,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:15:28,877 INFO L87 Difference]: Start difference. First operand 263 states and 347 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (3), 1 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 07:15:29,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:29,955 INFO L93 Difference]: Finished difference Result 402 states and 518 transitions. [2024-11-09 07:15:29,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:15:29,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (3), 1 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 67 [2024-11-09 07:15:29,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:29,958 INFO L225 Difference]: With dead ends: 402 [2024-11-09 07:15:29,958 INFO L226 Difference]: Without dead ends: 402 [2024-11-09 07:15:29,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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 07:15:29,959 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 126 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:29,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 689 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 07:15:29,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-09 07:15:29,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 369. [2024-11-09 07:15:29,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 341 states have (on average 1.2668621700879765) internal successors, (432), 358 states have internal predecessors, (432), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-09 07:15:29,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 476 transitions. [2024-11-09 07:15:29,979 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 476 transitions. Word has length 67 [2024-11-09 07:15:29,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:29,980 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 476 transitions. [2024-11-09 07:15:29,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (3), 1 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 07:15:29,980 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 476 transitions. [2024-11-09 07:15:29,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-09 07:15:29,982 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:29,982 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:15:29,995 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 07:15:30,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:15:30,184 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:15:30,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:30,185 INFO L85 PathProgramCache]: Analyzing trace with hash -2007894925, now seen corresponding path program 1 times [2024-11-09 07:15:30,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:15:30,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [495182607] [2024-11-09 07:15:30,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:30,186 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 07:15:30,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:15:30,189 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 07:15:30,193 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 07:15:30,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:30,617 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:15:30,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:30,651 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:15:30,651 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:15:30,652 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:15:30,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [495182607] [2024-11-09 07:15:30,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [495182607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:15:30,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:15:30,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:15:30,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657591669] [2024-11-09 07:15:30,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:15:30,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:15:30,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:15:30,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:15:30,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:15:30,655 INFO L87 Difference]: Start difference. First operand 369 states and 476 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:15:30,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:30,696 INFO L93 Difference]: Finished difference Result 372 states and 480 transitions. [2024-11-09 07:15:30,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:15:30,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 82 [2024-11-09 07:15:30,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:30,702 INFO L225 Difference]: With dead ends: 372 [2024-11-09 07:15:30,702 INFO L226 Difference]: Without dead ends: 372 [2024-11-09 07:15:30,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 79 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 07:15:30,703 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 0 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:30,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1022 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:15:30,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-09 07:15:30,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2024-11-09 07:15:30,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 343 states have (on average 1.2682215743440233) internal successors, (435), 361 states have internal predecessors, (435), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-09 07:15:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 480 transitions. [2024-11-09 07:15:30,723 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 480 transitions. Word has length 82 [2024-11-09 07:15:30,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:30,723 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 480 transitions. [2024-11-09 07:15:30,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:15:30,723 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 480 transitions. [2024-11-09 07:15:30,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-09 07:15:30,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:30,725 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:15:30,741 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 07:15:30,929 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 07:15:30,930 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:15:30,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:30,931 INFO L85 PathProgramCache]: Analyzing trace with hash 1850860785, now seen corresponding path program 1 times [2024-11-09 07:15:30,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:15:30,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1845491989] [2024-11-09 07:15:30,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:15:30,932 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 07:15:30,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:15:30,935 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 07:15:30,937 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 07:15:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:15:31,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:15:31,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:31,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:15:31,489 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:15:31,595 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:15:31,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:15:31,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1845491989] [2024-11-09 07:15:31,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1845491989] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:15:31,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:15:31,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-09 07:15:31,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353907226] [2024-11-09 07:15:31,596 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:15:31,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:15:31,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:15:31,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:15:31,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:15:31,597 INFO L87 Difference]: Start difference. First operand 372 states and 480 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:15:31,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:31,741 INFO L93 Difference]: Finished difference Result 383 states and 496 transitions. [2024-11-09 07:15:31,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:15:31,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 84 [2024-11-09 07:15:31,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:31,744 INFO L225 Difference]: With dead ends: 383 [2024-11-09 07:15:31,744 INFO L226 Difference]: Without dead ends: 383 [2024-11-09 07:15:31,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:15:31,745 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 5 mSDsluCounter, 1357 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1699 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:31,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1699 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:15:31,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-09 07:15:31,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2024-11-09 07:15:31,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 351 states have (on average 1.2792022792022792) internal successors, (449), 369 states have internal predecessors, (449), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-09 07:15:31,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 494 transitions. [2024-11-09 07:15:31,755 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 494 transitions. Word has length 84 [2024-11-09 07:15:31,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:31,756 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 494 transitions. [2024-11-09 07:15:31,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:15:31,756 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 494 transitions. [2024-11-09 07:15:31,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-09 07:15:31,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:31,758 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:15:31,771 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 07:15:31,962 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 07:15:31,963 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:15:31,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:31,964 INFO L85 PathProgramCache]: Analyzing trace with hash 45321043, now seen corresponding path program 2 times [2024-11-09 07:15:31,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:15:31,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927392002] [2024-11-09 07:15:31,965 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:15:31,965 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 07:15:31,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:15:31,968 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 07:15:31,969 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 07:15:33,769 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:15:33,769 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:15:33,803 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:15:33,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:15:33,870 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:15:34,039 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:15:34,040 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:15:34,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [927392002] [2024-11-09 07:15:34,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [927392002] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:15:34,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:15:34,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-09 07:15:34,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904192484] [2024-11-09 07:15:34,041 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:15:34,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:15:34,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:15:34,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:15:34,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:15:34,043 INFO L87 Difference]: Start difference. First operand 381 states and 494 transitions. Second operand has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:15:34,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:34,570 INFO L93 Difference]: Finished difference Result 396 states and 516 transitions. [2024-11-09 07:15:34,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:15:34,571 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 88 [2024-11-09 07:15:34,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:34,572 INFO L225 Difference]: With dead ends: 396 [2024-11-09 07:15:34,572 INFO L226 Difference]: Without dead ends: 392 [2024-11-09 07:15:34,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:15:34,573 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 7 mSDsluCounter, 2714 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3056 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:34,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3056 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:15:34,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-09 07:15:34,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 390. [2024-11-09 07:15:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 360 states have (on average 1.2805555555555554) internal successors, (461), 378 states have internal predecessors, (461), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-09 07:15:34,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 506 transitions. [2024-11-09 07:15:34,582 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 506 transitions. Word has length 88 [2024-11-09 07:15:34,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:34,582 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 506 transitions. [2024-11-09 07:15:34,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:15:34,582 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 506 transitions. [2024-11-09 07:15:34,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 07:15:34,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:34,583 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:15:34,601 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 07:15:34,787 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 07:15:34,788 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:15:34,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:34,789 INFO L85 PathProgramCache]: Analyzing trace with hash -335891100, now seen corresponding path program 3 times [2024-11-09 07:15:34,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:15:34,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [754402529] [2024-11-09 07:15:34,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:15:34,789 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 07:15:34,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:15:34,791 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 07:15:34,793 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 07:15:37,281 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-09 07:15:37,281 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:15:37,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:15:37,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 68 proven. 15 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-09 07:15:37,460 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:15:37,771 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 68 proven. 15 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-09 07:15:37,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:15:37,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [754402529] [2024-11-09 07:15:37,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [754402529] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:15:37,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:15:37,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-09 07:15:37,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432646413] [2024-11-09 07:15:37,772 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:15:37,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 07:15:37,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:15:37,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 07:15:37,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:15:37,781 INFO L87 Difference]: Start difference. First operand 390 states and 506 transitions. Second operand has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:15:38,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:38,320 INFO L93 Difference]: Finished difference Result 401 states and 523 transitions. [2024-11-09 07:15:38,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 07:15:38,321 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 97 [2024-11-09 07:15:38,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:38,322 INFO L225 Difference]: With dead ends: 401 [2024-11-09 07:15:38,322 INFO L226 Difference]: Without dead ends: 399 [2024-11-09 07:15:38,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2024-11-09 07:15:38,323 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 8 mSDsluCounter, 2380 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2722 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:38,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2722 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:15:38,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-09 07:15:38,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 397. [2024-11-09 07:15:38,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 367 states have (on average 1.2915531335149864) internal successors, (474), 385 states have internal predecessors, (474), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-09 07:15:38,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 519 transitions. [2024-11-09 07:15:38,342 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 519 transitions. Word has length 97 [2024-11-09 07:15:38,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:38,342 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 519 transitions. [2024-11-09 07:15:38,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5625) internal successors, (89), 16 states have internal predecessors, (89), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:15:38,343 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 519 transitions. [2024-11-09 07:15:38,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-09 07:15:38,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:38,344 INFO L215 NwaCegarLoop]: trace histogram [22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:15:38,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 07:15:38,545 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 07:15:38,545 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:15:38,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:38,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1746149101, now seen corresponding path program 4 times [2024-11-09 07:15:38,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:15:38,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477657759] [2024-11-09 07:15:38,547 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-09 07:15:38,547 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 07:15:38,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:15:38,550 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 07:15:38,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 07:15:39,219 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-09 07:15:39,219 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:15:39,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 07:15:39,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 146 proven. 55 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-09 07:15:39,435 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:15:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-09 07:15:39,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:15:39,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477657759] [2024-11-09 07:15:39,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477657759] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:15:39,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:15:39,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-09 07:15:39,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079229065] [2024-11-09 07:15:39,921 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:15:39,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 07:15:39,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:15:39,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 07:15:39,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-09 07:15:39,924 INFO L87 Difference]: Start difference. First operand 397 states and 519 transitions. Second operand has 26 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:15:41,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:41,681 INFO L93 Difference]: Finished difference Result 415 states and 547 transitions. [2024-11-09 07:15:41,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-09 07:15:41,682 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 104 [2024-11-09 07:15:41,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:41,684 INFO L225 Difference]: With dead ends: 415 [2024-11-09 07:15:41,684 INFO L226 Difference]: Without dead ends: 411 [2024-11-09 07:15:41,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 07:15:41,686 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 13 mSDsluCounter, 5091 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 5433 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:41,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 5433 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 07:15:41,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-09 07:15:41,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2024-11-09 07:15:41,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 379 states have (on average 1.2823218997361479) internal successors, (486), 397 states have internal predecessors, (486), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-09 07:15:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 531 transitions. [2024-11-09 07:15:41,695 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 531 transitions. Word has length 104 [2024-11-09 07:15:41,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:41,696 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 531 transitions. [2024-11-09 07:15:41,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.9615384615384617) internal successors, (103), 26 states have internal predecessors, (103), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:15:41,696 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 531 transitions. [2024-11-09 07:15:41,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 07:15:41,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:41,697 INFO L215 NwaCegarLoop]: trace histogram [34, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:15:41,714 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 07:15:41,901 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 07:15:41,902 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:15:41,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:41,902 INFO L85 PathProgramCache]: Analyzing trace with hash 836730707, now seen corresponding path program 5 times [2024-11-09 07:15:41,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:15:41,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769941603] [2024-11-09 07:15:41,904 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-09 07:15:41,904 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 07:15:41,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:15:41,907 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 07:15:41,909 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 07:15:43,040 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2024-11-09 07:15:43,041 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:15:43,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 07:15:43,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:15:43,604 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 302 proven. 253 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-09 07:15:43,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:15:45,778 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 0 proven. 554 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2024-11-09 07:15:45,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:15:45,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769941603] [2024-11-09 07:15:45,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [769941603] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:15:45,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:15:45,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-09 07:15:45,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624743058] [2024-11-09 07:15:45,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:15:45,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 07:15:45,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:15:45,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 07:15:45,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 07:15:45,786 INFO L87 Difference]: Start difference. First operand 409 states and 531 transitions. Second operand has 50 states, 50 states have (on average 2.54) internal successors, (127), 50 states have internal predecessors, (127), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:15:52,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:15:52,229 INFO L93 Difference]: Finished difference Result 448 states and 601 transitions. [2024-11-09 07:15:52,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-09 07:15:52,230 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.54) internal successors, (127), 50 states have internal predecessors, (127), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 116 [2024-11-09 07:15:52,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:15:52,232 INFO L225 Difference]: With dead ends: 448 [2024-11-09 07:15:52,232 INFO L226 Difference]: Without dead ends: 444 [2024-11-09 07:15:52,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-09 07:15:52,236 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 25 mSDsluCounter, 8497 mSDsCounter, 0 mSdLazyCounter, 1899 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8839 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:15:52,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 8839 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1899 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-09 07:15:52,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-09 07:15:52,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 442. [2024-11-09 07:15:52,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 412 states have (on average 1.2864077669902914) internal successors, (530), 430 states have internal predecessors, (530), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-09 07:15:52,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 575 transitions. [2024-11-09 07:15:52,244 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 575 transitions. Word has length 116 [2024-11-09 07:15:52,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:15:52,244 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 575 transitions. [2024-11-09 07:15:52,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.54) internal successors, (127), 50 states have internal predecessors, (127), 2 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:15:52,245 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 575 transitions. [2024-11-09 07:15:52,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-09 07:15:52,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:15:52,246 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:15:52,266 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 07:15:52,449 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 07:15:52,450 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:15:52,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:15:52,451 INFO L85 PathProgramCache]: Analyzing trace with hash 791926244, now seen corresponding path program 6 times [2024-11-09 07:15:52,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:15:52,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1745096568] [2024-11-09 07:15:52,452 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-09 07:15:52,452 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 07:15:52,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:15:52,453 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 07:15:52,455 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 07:16:02,431 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2024-11-09 07:16:02,432 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:16:02,520 INFO L255 TraceCheckSpWp]: Trace formula consists of 1191 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-09 07:16:02,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:16:03,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1082 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-09 07:16:03,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:16:06,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 1082 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-09 07:16:06,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:16:06,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1745096568] [2024-11-09 07:16:06,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1745096568] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:16:06,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:16:06,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-09 07:16:06,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694209774] [2024-11-09 07:16:06,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:16:06,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-09 07:16:06,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:16:06,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-09 07:16:06,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-09 07:16:06,165 INFO L87 Difference]: Start difference. First operand 442 states and 575 transitions. Second operand has 52 states, 52 states have (on average 2.4038461538461537) internal successors, (125), 52 states have internal predecessors, (125), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:16:13,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:16:13,778 INFO L93 Difference]: Finished difference Result 471 states and 628 transitions. [2024-11-09 07:16:13,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-09 07:16:13,779 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.4038461538461537) internal successors, (125), 52 states have internal predecessors, (125), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 149 [2024-11-09 07:16:13,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:16:13,783 INFO L225 Difference]: With dead ends: 471 [2024-11-09 07:16:13,783 INFO L226 Difference]: Without dead ends: 469 [2024-11-09 07:16:13,785 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-09 07:16:13,786 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 27 mSDsluCounter, 8162 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 8504 SdHoareTripleChecker+Invalid, 1412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:16:13,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 8504 Invalid, 1412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 07:16:13,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-11-09 07:16:13,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 467. [2024-11-09 07:16:13,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 437 states have (on average 1.3249427917620138) internal successors, (579), 455 states have internal predecessors, (579), 23 states have call successors, (23), 5 states have call predecessors, (23), 5 states have return successors, (22), 7 states have call predecessors, (22), 21 states have call successors, (22) [2024-11-09 07:16:13,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 624 transitions. [2024-11-09 07:16:13,801 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 624 transitions. Word has length 149 [2024-11-09 07:16:13,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:16:13,802 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 624 transitions. [2024-11-09 07:16:13,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.4038461538461537) internal successors, (125), 52 states have internal predecessors, (125), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:16:13,802 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 624 transitions. [2024-11-09 07:16:13,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-09 07:16:13,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:16:13,804 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:16:13,837 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 07:16:14,007 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 07:16:14,008 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:16:14,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:16:14,009 INFO L85 PathProgramCache]: Analyzing trace with hash 428899251, now seen corresponding path program 7 times [2024-11-09 07:16:14,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:16:14,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490420540] [2024-11-09 07:16:14,010 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-09 07:16:14,011 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 07:16:14,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:16:14,013 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 07:16:14,019 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 07:16:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:16:15,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 1466 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-09 07:16:15,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:16:17,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4374 backedges. 2207 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-09 07:16:17,708 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:16:23,366 INFO L134 CoverageAnalysis]: Checked inductivity of 4374 backedges. 2207 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-09 07:16:23,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:16:23,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490420540] [2024-11-09 07:16:23,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490420540] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:16:23,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:16:23,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-09 07:16:23,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819762175] [2024-11-09 07:16:23,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:16:23,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-09 07:16:23,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:16:23,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-09 07:16:23,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-09 07:16:23,372 INFO L87 Difference]: Start difference. First operand 467 states and 624 transitions. Second operand has 102 states, 102 states have (on average 1.7156862745098038) internal successors, (175), 102 states have internal predecessors, (175), 2 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)