./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_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 dfe9cedb3fb732c747a1ef802da6fccda86efe7de6f5d2fc74063f23f28dc4dd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 14:23:57,632 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:23:57,719 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-20 14:23:57,723 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:23:57,723 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:23:57,743 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:23:57,744 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:23:57,744 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:23:57,745 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 14:23:57,745 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 14:23:57,745 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:23:57,745 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:23:57,746 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:23:57,746 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:23:57,747 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:23:57,747 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:23:57,748 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 14:23:57,748 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 14:23:57,748 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:23:57,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 14:23:57,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:23:57,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 14:23:57,750 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 14:23:57,750 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 14:23:57,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:23:57,751 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 14:23:57,751 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 14:23:57,751 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:23:57,752 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:23:57,752 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 14:23:57,752 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 14:23:57,753 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:23:57,753 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:23:57,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:23:57,754 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 14:23:57,754 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:23:57,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:23:57,755 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:23:57,755 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:23:57,755 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 14:23:57,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 14:23:57,756 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:23:57,759 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:23:57,759 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:23:57,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:23:57,760 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 -> dfe9cedb3fb732c747a1ef802da6fccda86efe7de6f5d2fc74063f23f28dc4dd [2024-11-20 14:23:58,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:23:58,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:23:58,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:23:58,067 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:23:58,068 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:23:58,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i [2024-11-20 14:23:59,514 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:23:59,814 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:23:59,818 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i [2024-11-20 14:23:59,840 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/740f2e4df/2ffa31c796514ba19c1e6a93aa3e96d6/FLAG58993e3c1 [2024-11-20 14:23:59,855 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/740f2e4df/2ffa31c796514ba19c1e6a93aa3e96d6 [2024-11-20 14:23:59,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:23:59,859 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:23:59,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:23:59,861 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:23:59,866 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:23:59,866 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:23:59" (1/1) ... [2024-11-20 14:23:59,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@103e4370 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:23:59, skipping insertion in model container [2024-11-20 14:23:59,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:23:59" (1/1) ... [2024-11-20 14:23:59,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:24:00,310 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:00,354 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:00,360 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:00,366 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:00,373 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:00,420 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:00,424 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:00,426 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:00,427 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:00,431 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:00,433 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:00,438 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:00,439 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:00,446 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:00,451 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:00,452 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:00,455 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:00,456 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:00,496 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:00,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:24:00,534 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-20 14:24:00,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3aeae273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:00, skipping insertion in model container [2024-11-20 14:24:00,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:24:00,536 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-20 14:24:00,537 INFO L158 Benchmark]: Toolchain (without parser) took 677.28ms. Allocated memory is still 144.7MB. Free memory was 87.7MB in the beginning and 113.9MB in the end (delta: -26.1MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-11-20 14:24:00,538 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 144.7MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 14:24:00,538 INFO L158 Benchmark]: CACSL2BoogieTranslator took 675.37ms. Allocated memory is still 144.7MB. Free memory was 87.4MB in the beginning and 113.9MB in the end (delta: -26.5MB). Peak memory consumption was 30.6MB. Max. memory is 16.1GB. [2024-11-20 14:24:00,540 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.29ms. Allocated memory is still 144.7MB. Free memory is still 105.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 675.37ms. Allocated memory is still 144.7MB. Free memory was 87.4MB in the beginning and 113.9MB in the end (delta: -26.5MB). Peak memory consumption was 30.6MB. 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_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 dfe9cedb3fb732c747a1ef802da6fccda86efe7de6f5d2fc74063f23f28dc4dd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 14:24:02,513 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:24:02,577 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-20 14:24:02,582 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:24:02,585 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:24:02,620 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:24:02,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:24:02,623 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:24:02,624 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 14:24:02,624 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 14:24:02,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:24:02,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:24:02,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:24:02,627 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:24:02,628 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:24:02,628 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:24:02,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 14:24:02,629 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 14:24:02,629 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:24:02,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 14:24:02,630 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:24:02,633 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 14:24:02,634 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 14:24:02,634 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 14:24:02,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:24:02,635 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 14:24:02,635 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 14:24:02,635 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 14:24:02,635 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:24:02,636 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 14:24:02,636 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:24:02,636 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 14:24:02,636 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 14:24:02,636 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:24:02,636 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:24:02,637 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:24:02,637 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 14:24:02,637 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:24:02,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:24:02,638 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:24:02,638 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:24:02,638 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 14:24:02,639 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 14:24:02,639 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:24:02,640 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:24:02,640 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:24:02,641 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:24:02,641 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 -> dfe9cedb3fb732c747a1ef802da6fccda86efe7de6f5d2fc74063f23f28dc4dd [2024-11-20 14:24:02,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:24:02,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:24:02,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:24:02,981 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:24:02,981 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:24:02,982 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i [2024-11-20 14:24:04,571 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:24:04,892 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:24:04,893 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test8-2.i [2024-11-20 14:24:04,919 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21eed7c6f/dd95ac6930ae4a17a948f1b2f8819e48/FLAGae0ffb83a [2024-11-20 14:24:04,937 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21eed7c6f/dd95ac6930ae4a17a948f1b2f8819e48 [2024-11-20 14:24:04,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:24:04,942 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:24:04,945 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:24:04,946 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:24:04,951 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:24:04,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:24:04" (1/1) ... [2024-11-20 14:24:04,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76e02c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:04, skipping insertion in model container [2024-11-20 14:24:04,955 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:24:04" (1/1) ... [2024-11-20 14:24:05,046 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:24:05,475 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,511 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,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-20 14:24:05,522 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,528 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,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-20 14:24:05,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-20 14:24:05,560 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,560 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,571 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,574 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,575 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,576 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,584 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,586 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,591 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,592 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,592 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,599 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:24:05,635 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-20 14:24:05,644 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:24:05,678 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,691 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,693 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,695 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,699 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,718 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,718 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,720 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,720 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,722 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,723 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,723 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,724 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,727 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,729 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,730 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,730 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,731 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,734 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:24:05,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:24:05,743 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 14:24:05,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:24:05,915 INFO L204 MainTranslator]: Completed translation [2024-11-20 14:24:05,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:05 WrapperNode [2024-11-20 14:24:05,916 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:24:05,917 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 14:24:05,918 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 14:24:05,918 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 14:24:05,927 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:05" (1/1) ... [2024-11-20 14:24:05,972 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:05" (1/1) ... [2024-11-20 14:24:06,053 INFO L138 Inliner]: procedures = 180, calls = 342, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1176 [2024-11-20 14:24:06,059 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 14:24:06,060 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 14:24:06,060 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 14:24:06,060 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 14:24:06,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:05" (1/1) ... [2024-11-20 14:24:06,073 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:05" (1/1) ... [2024-11-20 14:24:06,086 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:05" (1/1) ... [2024-11-20 14:24:06,196 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-20 14:24:06,197 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:05" (1/1) ... [2024-11-20 14:24:06,197 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:05" (1/1) ... [2024-11-20 14:24:06,242 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:05" (1/1) ... [2024-11-20 14:24:06,254 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:05" (1/1) ... [2024-11-20 14:24:06,265 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:05" (1/1) ... [2024-11-20 14:24:06,274 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:05" (1/1) ... [2024-11-20 14:24:06,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 14:24:06,294 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 14:24:06,294 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 14:24:06,297 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 14:24:06,298 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:05" (1/1) ... [2024-11-20 14:24:06,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:24:06,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:24:06,336 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 14:24:06,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 14:24:06,385 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-20 14:24:06,386 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-20 14:24:06,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 14:24:06,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 14:24:06,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-20 14:24:06,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 14:24:06,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 14:24:06,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-20 14:24:06,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-20 14:24:06,387 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-20 14:24:06,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-20 14:24:06,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-20 14:24:06,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-20 14:24:06,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-20 14:24:06,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-20 14:24:06,387 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-20 14:24:06,388 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2024-11-20 14:24:06,388 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2024-11-20 14:24:06,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 14:24:06,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 14:24:06,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 14:24:06,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 14:24:06,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-20 14:24:06,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 14:24:06,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 14:24:06,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 14:24:06,389 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-20 14:24:06,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 14:24:06,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 14:24:06,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 14:24:06,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-20 14:24:06,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 14:24:06,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 14:24:06,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 14:24:06,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 14:24:06,390 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 14:24:06,665 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 14:24:06,668 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 14:24:14,555 INFO L? ?]: Removed 161 outVars from TransFormulas that were not future-live. [2024-11-20 14:24:14,555 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 14:24:14,581 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 14:24:14,583 INFO L316 CfgBuilder]: Removed 71 assume(true) statements. [2024-11-20 14:24:14,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:24:14 BoogieIcfgContainer [2024-11-20 14:24:14,584 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 14:24:14,586 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 14:24:14,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 14:24:14,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 14:24:14,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:24:04" (1/3) ... [2024-11-20 14:24:14,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2685f31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:24:14, skipping insertion in model container [2024-11-20 14:24:14,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:24:05" (2/3) ... [2024-11-20 14:24:14,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2685f31f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:24:14, skipping insertion in model container [2024-11-20 14:24:14,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:24:14" (3/3) ... [2024-11-20 14:24:14,596 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test8-2.i [2024-11-20 14:24:14,614 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 14:24:14,614 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-20 14:24:14,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:24:14,688 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;@7825f8e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:24:14,689 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-20 14:24:14,694 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-20 14:24:14,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 14:24:14,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:24:14,705 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:24:14,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:24:14,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:24:14,711 INFO L85 PathProgramCache]: Analyzing trace with hash 901390748, now seen corresponding path program 1 times [2024-11-20 14:24:14,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:24:14,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058926877] [2024-11-20 14:24:14,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:24:14,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:14,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:24:14,728 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 14:24:14,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 (2)] Waiting until timeout for monitored process [2024-11-20 14:24:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:24:14,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 14:24:14,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:24:14,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:24:14,931 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:24:14,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:24:14,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058926877] [2024-11-20 14:24:14,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2058926877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:24:14,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:24:14,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:24:14,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791746409] [2024-11-20 14:24:14,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:24:14,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 14:24:14,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:24:14,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 14:24:14,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 14:24:14,968 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-20 14:24:15,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:24:15,003 INFO L93 Difference]: Finished difference Result 266 states and 362 transitions. [2024-11-20 14:24:15,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 14:24:15,007 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-20 14:24:15,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:24:15,019 INFO L225 Difference]: With dead ends: 266 [2024-11-20 14:24:15,019 INFO L226 Difference]: Without dead ends: 264 [2024-11-20 14:24:15,021 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-20 14:24:15,024 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-20 14:24:15,025 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-20 14:24:15,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-20 14:24:15,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-11-20 14:24:15,074 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-20 14:24:15,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 360 transitions. [2024-11-20 14:24:15,081 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 360 transitions. Word has length 11 [2024-11-20 14:24:15,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:24:15,081 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 360 transitions. [2024-11-20 14:24:15,081 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-20 14:24:15,082 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 360 transitions. [2024-11-20 14:24:15,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 14:24:15,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:24:15,082 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:24:15,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 14:24:15,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:15,284 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:24:15,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:24:15,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1574241252, now seen corresponding path program 1 times [2024-11-20 14:24:15,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:24:15,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78607322] [2024-11-20 14:24:15,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:24:15,285 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:15,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:24:15,310 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 14:24:15,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 14:24:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:24:15,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 14:24:15,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:24:15,573 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:24:15,575 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:24:15,575 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:24:15,586 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-20 14:24:15,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:24:15,668 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-20 14:24:15,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:24:15,694 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:24:15,695 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:24:15,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78607322] [2024-11-20 14:24:15,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78607322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:24:15,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:24:15,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:24:15,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537544903] [2024-11-20 14:24:15,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:24:15,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:24:15,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:24:15,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:24:15,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:24:15,699 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-20 14:24:16,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:24:16,393 INFO L93 Difference]: Finished difference Result 477 states and 641 transitions. [2024-11-20 14:24:16,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:24:16,397 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-20 14:24:16,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:24:16,400 INFO L225 Difference]: With dead ends: 477 [2024-11-20 14:24:16,400 INFO L226 Difference]: Without dead ends: 477 [2024-11-20 14:24:16,400 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-20 14:24:16,401 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 267 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-20 14:24:16,402 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.6s Time] [2024-11-20 14:24:16,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-20 14:24:16,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 266. [2024-11-20 14:24:16,424 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-20 14:24:16,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 362 transitions. [2024-11-20 14:24:16,427 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 362 transitions. Word has length 13 [2024-11-20 14:24:16,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:24:16,427 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 362 transitions. [2024-11-20 14:24:16,428 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-20 14:24:16,428 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 362 transitions. [2024-11-20 14:24:16,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 14:24:16,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:24:16,430 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-20 14:24:16,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-20 14:24:16,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:16,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:24:16,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:24:16,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1418349862, now seen corresponding path program 1 times [2024-11-20 14:24:16,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:24:16,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [412871024] [2024-11-20 14:24:16,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:24:16,637 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:16,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:24:16,640 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 14:24:16,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 14:24:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:24:17,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 14:24:17,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:24:17,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:24:17,050 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:24:17,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:24:17,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [412871024] [2024-11-20 14:24:17,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [412871024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:24:17,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:24:17,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:24:17,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095520966] [2024-11-20 14:24:17,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:24:17,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:24:17,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:24:17,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:24:17,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:24:17,053 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-20 14:24:17,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:24:17,192 INFO L93 Difference]: Finished difference Result 269 states and 357 transitions. [2024-11-20 14:24:17,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:24:17,192 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-20 14:24:17,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:24:17,194 INFO L225 Difference]: With dead ends: 269 [2024-11-20 14:24:17,194 INFO L226 Difference]: Without dead ends: 269 [2024-11-20 14:24:17,195 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-20 14:24:17,197 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-20 14:24:17,198 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-20 14:24:17,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-20 14:24:17,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-20 14:24:17,216 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-20 14:24:17,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 357 transitions. [2024-11-20 14:24:17,218 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 357 transitions. Word has length 67 [2024-11-20 14:24:17,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:24:17,218 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 357 transitions. [2024-11-20 14:24:17,218 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-20 14:24:17,218 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 357 transitions. [2024-11-20 14:24:17,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 14:24:17,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:24:17,220 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-20 14:24:17,231 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-20 14:24:17,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:17,421 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:24:17,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:24:17,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1396463258, now seen corresponding path program 1 times [2024-11-20 14:24:17,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:24:17,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823379643] [2024-11-20 14:24:17,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:24:17,423 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:17,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:24:17,426 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 14:24:17,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 14:24:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:24:17,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 14:24:17,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:24:17,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:24:17,891 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:24:17,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:24:17,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823379643] [2024-11-20 14:24:17,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823379643] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:24:17,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:24:17,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:24:17,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788729438] [2024-11-20 14:24:17,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:24:17,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:24:17,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:24:17,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:24:17,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:24:17,894 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-20 14:24:18,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:24:18,002 INFO L93 Difference]: Finished difference Result 263 states and 347 transitions. [2024-11-20 14:24:18,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:24:18,003 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-20 14:24:18,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:24:18,006 INFO L225 Difference]: With dead ends: 263 [2024-11-20 14:24:18,007 INFO L226 Difference]: Without dead ends: 263 [2024-11-20 14:24:18,008 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-20 14:24:18,009 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-20 14:24:18,010 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-20 14:24:18,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-20 14:24:18,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2024-11-20 14:24:18,021 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-20 14:24:18,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 347 transitions. [2024-11-20 14:24:18,022 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 347 transitions. Word has length 67 [2024-11-20 14:24:18,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:24:18,023 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 347 transitions. [2024-11-20 14:24:18,023 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-20 14:24:18,023 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 347 transitions. [2024-11-20 14:24:18,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 14:24:18,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:24:18,025 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-20 14:24:18,039 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-20 14:24:18,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:18,226 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:24:18,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:24:18,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1790830044, now seen corresponding path program 1 times [2024-11-20 14:24:18,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:24:18,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2013754584] [2024-11-20 14:24:18,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:24:18,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:18,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:24:18,231 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 14:24:18,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 14:24:18,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:24:18,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 14:24:18,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:24:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:24:18,876 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:24:18,876 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:24:18,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2013754584] [2024-11-20 14:24:18,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2013754584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:24:18,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:24:18,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:24:18,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895463251] [2024-11-20 14:24:18,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:24:18,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:24:18,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:24:18,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:24:18,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:24:18,879 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-20 14:24:19,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:24:19,826 INFO L93 Difference]: Finished difference Result 402 states and 518 transitions. [2024-11-20 14:24:19,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:24:19,827 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-20 14:24:19,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:24:19,829 INFO L225 Difference]: With dead ends: 402 [2024-11-20 14:24:19,830 INFO L226 Difference]: Without dead ends: 402 [2024-11-20 14:24:19,830 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-20 14:24:19,832 INFO L432 NwaCegarLoop]: 379 mSDtfsCounter, 126 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 14:24:19,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 689 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 14:24:19,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-20 14:24:19,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 369. [2024-11-20 14:24:19,845 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-20 14:24:19,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 476 transitions. [2024-11-20 14:24:19,847 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 476 transitions. Word has length 67 [2024-11-20 14:24:19,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:24:19,847 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 476 transitions. [2024-11-20 14:24:19,848 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-20 14:24:19,848 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 476 transitions. [2024-11-20 14:24:19,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-20 14:24:19,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:24:19,850 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-20 14:24:19,860 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-20 14:24:20,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:20,051 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:24:20,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:24:20,052 INFO L85 PathProgramCache]: Analyzing trace with hash -2007894925, now seen corresponding path program 1 times [2024-11-20 14:24:20,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:24:20,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1262054800] [2024-11-20 14:24:20,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:24:20,053 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:20,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:24:20,056 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 14:24:20,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 14:24:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:24:20,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 14:24:20,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:24:20,527 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-20 14:24:20,527 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 14:24:20,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:24:20,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1262054800] [2024-11-20 14:24:20,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1262054800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:24:20,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:24:20,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:24:20,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160325745] [2024-11-20 14:24:20,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:24:20,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:24:20,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:24:20,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:24:20,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:24:20,531 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-20 14:24:20,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:24:20,571 INFO L93 Difference]: Finished difference Result 372 states and 480 transitions. [2024-11-20 14:24:20,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:24:20,572 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-20 14:24:20,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:24:20,575 INFO L225 Difference]: With dead ends: 372 [2024-11-20 14:24:20,575 INFO L226 Difference]: Without dead ends: 372 [2024-11-20 14:24:20,575 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-20 14:24:20,577 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-20 14:24:20,577 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-20 14:24:20,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-20 14:24:20,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2024-11-20 14:24:20,590 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-20 14:24:20,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 480 transitions. [2024-11-20 14:24:20,594 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 480 transitions. Word has length 82 [2024-11-20 14:24:20,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:24:20,594 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 480 transitions. [2024-11-20 14:24:20,595 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-20 14:24:20,595 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 480 transitions. [2024-11-20 14:24:20,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-20 14:24:20,599 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:24:20,599 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-20 14:24:20,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-20 14:24:20,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:20,801 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:24:20,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:24:20,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1850860785, now seen corresponding path program 1 times [2024-11-20 14:24:20,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:24:20,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119574261] [2024-11-20 14:24:20,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:24:20,802 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:20,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:24:20,805 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 14:24:20,806 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-20 14:24:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:24:21,222 INFO L255 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 14:24:21,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:24:21,257 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-20 14:24:21,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:24:21,356 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-20 14:24:21,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:24:21,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119574261] [2024-11-20 14:24:21,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119574261] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:24:21,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:24:21,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-20 14:24:21,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698381606] [2024-11-20 14:24:21,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:24:21,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:24:21,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:24:21,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:24:21,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:24:21,359 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-20 14:24:21,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:24:21,529 INFO L93 Difference]: Finished difference Result 383 states and 496 transitions. [2024-11-20 14:24:21,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:24:21,529 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-20 14:24:21,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:24:21,531 INFO L225 Difference]: With dead ends: 383 [2024-11-20 14:24:21,531 INFO L226 Difference]: Without dead ends: 383 [2024-11-20 14:24:21,532 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-20 14:24:21,533 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-20 14:24:21,534 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-20 14:24:21,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-20 14:24:21,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2024-11-20 14:24:21,542 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-20 14:24:21,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 494 transitions. [2024-11-20 14:24:21,544 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 494 transitions. Word has length 84 [2024-11-20 14:24:21,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:24:21,544 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 494 transitions. [2024-11-20 14:24:21,544 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-20 14:24:21,544 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 494 transitions. [2024-11-20 14:24:21,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-20 14:24:21,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:24:21,548 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-20 14:24:21,560 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-20 14:24:21,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:21,749 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:24:21,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:24:21,749 INFO L85 PathProgramCache]: Analyzing trace with hash 45321043, now seen corresponding path program 2 times [2024-11-20 14:24:21,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:24:21,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289952267] [2024-11-20 14:24:21,750 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 14:24:21,750 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:21,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:24:21,751 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 14:24:21,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-20 14:24:23,304 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 14:24:23,305 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:24:23,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 520 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 14:24:23,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:24:23,422 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-20 14:24:23,422 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:24:23,622 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-20 14:24:23,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:24:23,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289952267] [2024-11-20 14:24:23,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1289952267] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:24:23,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:24:23,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-20 14:24:23,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516766030] [2024-11-20 14:24:23,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:24:23,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 14:24:23,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:24:23,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 14:24:23,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-20 14:24:23,625 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-20 14:24:24,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:24:24,188 INFO L93 Difference]: Finished difference Result 396 states and 516 transitions. [2024-11-20 14:24:24,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 14:24:24,189 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-20 14:24:24,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:24:24,191 INFO L225 Difference]: With dead ends: 396 [2024-11-20 14:24:24,191 INFO L226 Difference]: Without dead ends: 392 [2024-11-20 14:24:24,191 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-20 14:24:24,192 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 7 mSDsluCounter, 2714 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-20 14:24:24,193 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-20 14:24:24,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2024-11-20 14:24:24,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 390. [2024-11-20 14:24:24,208 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-20 14:24:24,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 506 transitions. [2024-11-20 14:24:24,210 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 506 transitions. Word has length 88 [2024-11-20 14:24:24,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:24:24,211 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 506 transitions. [2024-11-20 14:24:24,212 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-20 14:24:24,212 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 506 transitions. [2024-11-20 14:24:24,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 14:24:24,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:24:24,214 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-20 14:24:24,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-20 14:24:24,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:24,419 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:24:24,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:24:24,419 INFO L85 PathProgramCache]: Analyzing trace with hash -335891100, now seen corresponding path program 3 times [2024-11-20 14:24:24,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:24:24,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947562121] [2024-11-20 14:24:24,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 14:24:24,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:24,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:24:24,422 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 14:24:24,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-20 14:24:26,537 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-20 14:24:26,537 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:24:26,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 14:24:26,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:24:26,671 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-20 14:24:26,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:24:26,929 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-20 14:24:26,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:24:26,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947562121] [2024-11-20 14:24:26,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947562121] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:24:26,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:24:26,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-20 14:24:26,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906733844] [2024-11-20 14:24:26,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:24:26,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 14:24:26,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:24:26,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 14:24:26,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-20 14:24:26,932 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-20 14:24:27,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:24:27,429 INFO L93 Difference]: Finished difference Result 401 states and 523 transitions. [2024-11-20 14:24:27,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-20 14:24:27,430 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-20 14:24:27,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:24:27,432 INFO L225 Difference]: With dead ends: 401 [2024-11-20 14:24:27,432 INFO L226 Difference]: Without dead ends: 399 [2024-11-20 14:24:27,433 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-20 14:24:27,433 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-20 14:24:27,433 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-20 14:24:27,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-20 14:24:27,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 397. [2024-11-20 14:24:27,443 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-20 14:24:27,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 519 transitions. [2024-11-20 14:24:27,445 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 519 transitions. Word has length 97 [2024-11-20 14:24:27,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:24:27,446 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 519 transitions. [2024-11-20 14:24:27,447 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-20 14:24:27,447 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 519 transitions. [2024-11-20 14:24:27,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-20 14:24:27,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:24:27,448 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-20 14:24:27,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-20 14:24:27,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:27,649 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:24:27,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:24:27,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1746149101, now seen corresponding path program 4 times [2024-11-20 14:24:27,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:24:27,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1233913612] [2024-11-20 14:24:27,650 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-20 14:24:27,650 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:27,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:24:27,653 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 14:24:27,654 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-20 14:24:28,252 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-20 14:24:28,252 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:24:28,271 INFO L255 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-20 14:24:28,274 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:24:28,446 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-20 14:24:28,446 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:24:28,868 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-20 14:24:28,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:24:28,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1233913612] [2024-11-20 14:24:28,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1233913612] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:24:28,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:24:28,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-20 14:24:28,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447605441] [2024-11-20 14:24:28,869 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:24:28,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-20 14:24:28,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:24:28,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-20 14:24:28,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-20 14:24:28,871 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-20 14:24:30,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:24:30,334 INFO L93 Difference]: Finished difference Result 415 states and 547 transitions. [2024-11-20 14:24:30,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-20 14:24:30,336 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-20 14:24:30,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:24:30,338 INFO L225 Difference]: With dead ends: 415 [2024-11-20 14:24:30,338 INFO L226 Difference]: Without dead ends: 411 [2024-11-20 14:24:30,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-20 14:24:30,339 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 13 mSDsluCounter, 5091 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2024-11-20 14:24:30,340 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.6s Time] [2024-11-20 14:24:30,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-20 14:24:30,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2024-11-20 14:24:30,349 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-20 14:24:30,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 531 transitions. [2024-11-20 14:24:30,351 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 531 transitions. Word has length 104 [2024-11-20 14:24:30,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:24:30,352 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 531 transitions. [2024-11-20 14:24:30,352 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-20 14:24:30,352 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 531 transitions. [2024-11-20 14:24:30,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-20 14:24:30,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:24:30,353 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-20 14:24:30,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-20 14:24:30,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:30,554 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:24:30,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:24:30,554 INFO L85 PathProgramCache]: Analyzing trace with hash 836730707, now seen corresponding path program 5 times [2024-11-20 14:24:30,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:24:30,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755781034] [2024-11-20 14:24:30,555 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-20 14:24:30,555 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:30,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:24:30,556 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 14:24:30,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-20 14:24:31,567 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 13 check-sat command(s) [2024-11-20 14:24:31,567 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:24:31,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 828 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 14:24:31,594 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:24:32,050 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-20 14:24:32,050 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:24:33,606 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-20 14:24:33,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:24:33,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755781034] [2024-11-20 14:24:33,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1755781034] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:24:33,607 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:24:33,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-20 14:24:33,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883177652] [2024-11-20 14:24:33,607 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:24:33,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-20 14:24:33,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:24:33,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-20 14:24:33,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-20 14:24:33,609 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-20 14:24:38,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:24:38,710 INFO L93 Difference]: Finished difference Result 448 states and 601 transitions. [2024-11-20 14:24:38,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-20 14:24:38,711 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-20 14:24:38,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:24:38,713 INFO L225 Difference]: With dead ends: 448 [2024-11-20 14:24:38,715 INFO L226 Difference]: Without dead ends: 444 [2024-11-20 14:24:38,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-20 14:24:38,718 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 25 mSDsluCounter, 8497 mSDsCounter, 0 mSdLazyCounter, 1899 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:24:38,718 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.0s Time] [2024-11-20 14:24:38,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2024-11-20 14:24:38,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 442. [2024-11-20 14:24:38,727 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-20 14:24:38,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 575 transitions. [2024-11-20 14:24:38,729 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 575 transitions. Word has length 116 [2024-11-20 14:24:38,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:24:38,729 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 575 transitions. [2024-11-20 14:24:38,730 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-20 14:24:38,730 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 575 transitions. [2024-11-20 14:24:38,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2024-11-20 14:24:38,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:24:38,731 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-20 14:24:38,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-20 14:24:38,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:38,932 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:24:38,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:24:38,933 INFO L85 PathProgramCache]: Analyzing trace with hash 791926244, now seen corresponding path program 6 times [2024-11-20 14:24:38,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:24:38,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946031142] [2024-11-20 14:24:38,934 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-11-20 14:24:38,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:38,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:24:38,937 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 14:24:38,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-20 14:24:45,676 INFO L227 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 24 check-sat command(s) [2024-11-20 14:24:45,676 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:24:45,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 1191 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 14:24:45,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:24:46,260 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-20 14:24:46,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:24:48,442 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-20 14:24:48,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:24:48,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946031142] [2024-11-20 14:24:48,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946031142] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:24:48,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:24:48,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-20 14:24:48,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250248474] [2024-11-20 14:24:48,443 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:24:48,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-20 14:24:48,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:24:48,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-20 14:24:48,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-20 14:24:48,446 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-20 14:24:53,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:24:53,803 INFO L93 Difference]: Finished difference Result 471 states and 628 transitions. [2024-11-20 14:24:53,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-20 14:24:53,804 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-20 14:24:53,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:24:53,806 INFO L225 Difference]: With dead ends: 471 [2024-11-20 14:24:53,806 INFO L226 Difference]: Without dead ends: 469 [2024-11-20 14:24:53,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 343 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-20 14:24:53,809 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 27 mSDsluCounter, 8162 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:24:53,810 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.3s Time] [2024-11-20 14:24:53,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-11-20 14:24:53,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 467. [2024-11-20 14:24:53,819 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-20 14:24:53,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 624 transitions. [2024-11-20 14:24:53,821 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 624 transitions. Word has length 149 [2024-11-20 14:24:53,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:24:53,821 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 624 transitions. [2024-11-20 14:24:53,821 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-20 14:24:53,822 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 624 transitions. [2024-11-20 14:24:53,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-20 14:24:53,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:24:53,823 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-20 14:24:53,850 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-20 14:24:54,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:54,024 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:24:54,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:24:54,024 INFO L85 PathProgramCache]: Analyzing trace with hash 428899251, now seen corresponding path program 7 times [2024-11-20 14:24:54,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:24:54,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [202306298] [2024-11-20 14:24:54,025 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-11-20 14:24:54,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:24:54,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:24:54,026 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 14:24:54,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-20 14:24:55,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:24:55,420 INFO L255 TraceCheckSpWp]: Trace formula consists of 1466 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-20 14:24:55,424 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:24:56,919 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-20 14:24:56,920 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:25:02,245 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-20 14:25:02,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 14:25:02,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [202306298] [2024-11-20 14:25:02,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [202306298] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:25:02,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 14:25:02,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-20 14:25:02,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275796181] [2024-11-20 14:25:02,246 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 14:25:02,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-20 14:25:02,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 14:25:02,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-20 14:25:02,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-20 14:25:02,252 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) [2024-11-20 14:25:25,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:25:25,820 INFO L93 Difference]: Finished difference Result 525 states and 735 transitions. [2024-11-20 14:25:25,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2024-11-20 14:25:25,821 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 174 [2024-11-20 14:25:25,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:25:25,823 INFO L225 Difference]: With dead ends: 525 [2024-11-20 14:25:25,823 INFO L226 Difference]: Without dead ends: 525 [2024-11-20 14:25:25,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 443 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7008 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=12595, Invalid=26807, Unknown=0, NotChecked=0, Total=39402 [2024-11-20 14:25:25,849 INFO L432 NwaCegarLoop]: 341 mSDtfsCounter, 106 mSDsluCounter, 16950 mSDsCounter, 0 mSdLazyCounter, 5151 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 17291 SdHoareTripleChecker+Invalid, 5201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 5151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-20 14:25:25,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 17291 Invalid, 5201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 5151 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-20 14:25:25,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-20 14:25:25,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 521. [2024-11-20 14:25:25,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 491 states have (on average 1.3971486761710794) internal successors, (686), 509 states have internal predecessors, (686), 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-20 14:25:25,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 731 transitions. [2024-11-20 14:25:25,861 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 731 transitions. Word has length 174 [2024-11-20 14:25:25,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:25:25,862 INFO L471 AbstractCegarLoop]: Abstraction has 521 states and 731 transitions. [2024-11-20 14:25:25,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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) [2024-11-20 14:25:25,862 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 731 transitions. [2024-11-20 14:25:25,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-11-20 14:25:25,864 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:25:25,864 INFO L215 NwaCegarLoop]: trace histogram [142, 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-20 14:25:25,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-20 14:25:26,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:25:26,065 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-20 14:25:26,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:25:26,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1124606163, now seen corresponding path program 8 times [2024-11-20 14:25:26,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 14:25:26,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816120434] [2024-11-20 14:25:26,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 14:25:26,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 14:25:26,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 14:25:26,067 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 14:25:26,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process