./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.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 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:12:51,494 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:12:51,556 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-19 06:12:51,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:12:51,562 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:12:51,600 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:12:51,602 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:12:51,602 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:12:51,613 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:12:51,614 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:12:51,614 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:12:51,615 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:12:51,615 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:12:51,617 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:12:51,617 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:12:51,617 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:12:51,617 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:12:51,618 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:12:51,618 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:12:51,618 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:12:51,618 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:12:51,622 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:12:51,622 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:12:51,622 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:12:51,622 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:12:51,622 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:12:51,622 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:12:51,623 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:12:51,623 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:12:51,623 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:12:51,623 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:12:51,623 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:12:51,623 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:12:51,623 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:12:51,623 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:12:51,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:12:51,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:12:51,624 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:12:51,624 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:12:51,624 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:12:51,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:12:51,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:12:51,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:12:51,627 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:12:51,627 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:12:51,627 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 -> 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 [2024-11-19 06:12:51,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:12:51,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:12:51,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:12:51,861 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:12:51,861 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:12:51,863 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2024-11-19 06:12:53,321 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:12:53,585 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:12:53,586 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2024-11-19 06:12:53,609 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1c2895b2/324603498d9142c789de2f0d4261976a/FLAG6d8bdd4db [2024-11-19 06:12:53,623 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1c2895b2/324603498d9142c789de2f0d4261976a [2024-11-19 06:12:53,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:12:53,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:12:53,629 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:12:53,630 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:12:53,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:12:53,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:12:53" (1/1) ... [2024-11-19 06:12:53,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4458dcf9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:53, skipping insertion in model container [2024-11-19 06:12:53,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:12:53" (1/1) ... [2024-11-19 06:12:53,682 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:12:54,025 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-19 06:12:54,060 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-19 06:12:54,065 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-19 06:12:54,071 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-19 06:12:54,084 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-19 06:12:54,109 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-19 06:12:54,110 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-19 06:12:54,111 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-19 06:12:54,112 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-19 06:12:54,113 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-19 06:12:54,115 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-19 06:12:54,115 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-19 06:12:54,116 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-19 06:12:54,119 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-19 06:12:54,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:12:54,133 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-19 06:12:54,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1277e983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:54, skipping insertion in model container [2024-11-19 06:12:54,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:12:54,135 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 06:12:54,136 INFO L158 Benchmark]: Toolchain (without parser) took 508.61ms. Allocated memory is still 220.2MB. Free memory was 148.4MB in the beginning and 125.3MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 06:12:54,136 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 130.0MB. Free memory was 95.6MB in the beginning and 95.4MB in the end (delta: 117.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:12:54,137 INFO L158 Benchmark]: CACSL2BoogieTranslator took 505.06ms. Allocated memory is still 220.2MB. Free memory was 148.1MB in the beginning and 125.6MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 06:12:54,138 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.21ms. Allocated memory is still 130.0MB. Free memory was 95.6MB in the beginning and 95.4MB in the end (delta: 117.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 505.06ms. Allocated memory is still 220.2MB. Free memory was 148.1MB in the beginning and 125.6MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 727]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.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 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:12:56,021 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:12:56,088 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-19 06:12:56,093 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:12:56,095 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:12:56,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:12:56,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:12:56,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:12:56,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:12:56,124 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:12:56,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:12:56,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:12:56,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:12:56,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:12:56,126 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:12:56,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:12:56,127 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:12:56,127 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:12:56,129 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:12:56,129 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:12:56,129 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:12:56,129 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:12:56,130 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:12:56,130 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:12:56,132 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:12:56,132 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:12:56,133 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:12:56,133 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:12:56,133 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:12:56,133 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:12:56,133 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:12:56,133 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:12:56,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:12:56,134 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:12:56,134 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:12:56,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:12:56,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:12:56,134 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:12:56,134 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:12:56,134 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:12:56,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:12:56,135 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:12:56,136 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:12:56,136 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:12:56,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:12:56,136 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:12:56,137 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:12:56,137 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 -> 3d4f4fa5c64db6e2d1986e03259021eba4df8a22df3a334e78927feece513264 [2024-11-19 06:12:56,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:12:56,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:12:56,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:12:56,433 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:12:56,434 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:12:56,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2024-11-19 06:12:57,896 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:12:58,160 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:12:58,161 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test7-1.i [2024-11-19 06:12:58,174 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c726ec8a4/81721fcfb65248d4af97e3982fa45c02/FLAGc3f219ada [2024-11-19 06:12:58,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c726ec8a4/81721fcfb65248d4af97e3982fa45c02 [2024-11-19 06:12:58,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:12:58,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:12:58,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:12:58,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:12:58,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:12:58,196 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:12:58" (1/1) ... [2024-11-19 06:12:58,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@372945f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:58, skipping insertion in model container [2024-11-19 06:12:58,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:12:58" (1/1) ... [2024-11-19 06:12:58,238 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:12:58,573 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-19 06:12:58,600 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-19 06:12:58,603 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-19 06:12:58,618 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-19 06:12:58,628 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-19 06:12:58,651 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-19 06:12:58,651 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-19 06:12:58,653 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:58,654 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:58,656 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-19 06:12:58,657 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-19 06:12:58,658 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-19 06:12:58,659 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-19 06:12:58,662 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-19 06:12:58,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:12:58,676 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 06:12:58,685 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:12:58,700 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-19 06:12:58,716 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-19 06:12:58,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-19 06:12:58,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-19 06:12:58,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-19 06:12:58,752 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:58,752 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:12:58,754 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-19 06:12:58,754 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-19 06:12:58,756 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-19 06:12:58,757 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-19 06:12:58,757 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-19 06:12:58,758 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-19 06:12:58,761 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-19 06:12:58,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:12:58,776 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:12:58,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:12:58,888 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:12:58,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:58 WrapperNode [2024-11-19 06:12:58,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:12:58,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:12:58,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:12:58,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:12:58,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:58" (1/1) ... [2024-11-19 06:12:58,919 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:58" (1/1) ... [2024-11-19 06:12:58,977 INFO L138 Inliner]: procedures = 179, calls = 272, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1018 [2024-11-19 06:12:58,978 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:12:58,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:12:58,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:12:58,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:12:58,988 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:58" (1/1) ... [2024-11-19 06:12:58,989 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:58" (1/1) ... [2024-11-19 06:12:59,000 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:58" (1/1) ... [2024-11-19 06:12:59,060 INFO L175 MemorySlicer]: Split 253 memory accesses to 3 slices as follows [2, 34, 217]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-11-19 06:12:59,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:58" (1/1) ... [2024-11-19 06:12:59,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:58" (1/1) ... [2024-11-19 06:12:59,102 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:58" (1/1) ... [2024-11-19 06:12:59,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:58" (1/1) ... [2024-11-19 06:12:59,121 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:58" (1/1) ... [2024-11-19 06:12:59,129 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:58" (1/1) ... [2024-11-19 06:12:59,143 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:12:59,144 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:12:59,147 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:12:59,147 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:12:59,148 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:58" (1/1) ... [2024-11-19 06:12:59,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:12:59,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:12:59,177 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-19 06:12:59,180 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-19 06:12:59,222 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-19 06:12:59,222 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-19 06:12:59,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 06:12:59,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 06:12:59,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 06:12:59,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 06:12:59,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 06:12:59,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 06:12:59,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 06:12:59,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 06:12:59,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-19 06:12:59,224 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 06:12:59,224 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 06:12:59,224 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-19 06:12:59,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:12:59,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:12:59,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:12:59,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:12:59,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 06:12:59,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:12:59,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:12:59,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:12:59,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 06:12:59,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:12:59,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 06:12:59,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 06:12:59,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 06:12:59,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 06:12:59,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 06:12:59,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 06:12:59,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:12:59,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:12:59,428 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:12:59,430 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:13:07,543 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-11-19 06:13:07,543 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:13:07,557 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:13:07,557 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-19 06:13:07,558 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:13:07 BoogieIcfgContainer [2024-11-19 06:13:07,558 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:13:07,560 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:13:07,560 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:13:07,562 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:13:07,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:12:58" (1/3) ... [2024-11-19 06:13:07,563 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b84645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:13:07, skipping insertion in model container [2024-11-19 06:13:07,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:12:58" (2/3) ... [2024-11-19 06:13:07,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29b84645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:13:07, skipping insertion in model container [2024-11-19 06:13:07,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:13:07" (3/3) ... [2024-11-19 06:13:07,565 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test7-1.i [2024-11-19 06:13:07,579 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:13:07,580 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 06:13:07,617 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:13:07,623 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;@662def65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:13:07,623 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 06:13:07,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 197 states, 187 states have (on average 1.6684491978609626) internal successors, (312), 190 states have internal predecessors, (312), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-19 06:13:07,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:13:07,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:13:07,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:13:07,635 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:13:07,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:13:07,640 INFO L85 PathProgramCache]: Analyzing trace with hash 253905471, now seen corresponding path program 1 times [2024-11-19 06:13:07,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:13:07,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920789959] [2024-11-19 06:13:07,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:13:07,651 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-19 06:13:07,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:13:07,653 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-19 06:13:07,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 06:13:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:13:07,816 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 06:13:07,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:13:07,824 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-19 06:13:07,824 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:13:07,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:13:07,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920789959] [2024-11-19 06:13:07,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920789959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:13:07,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:13:07,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:13:07,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026296595] [2024-11-19 06:13:07,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:13:07,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:13:07,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:13:07,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:13:07,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:13:07,849 INFO L87 Difference]: Start difference. First operand has 197 states, 187 states have (on average 1.6684491978609626) internal successors, (312), 190 states have internal predecessors, (312), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:13:07,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:13:07,870 INFO L93 Difference]: Finished difference Result 194 states and 249 transitions. [2024-11-19 06:13:07,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:13:07,872 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 06:13:07,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:13:07,878 INFO L225 Difference]: With dead ends: 194 [2024-11-19 06:13:07,878 INFO L226 Difference]: Without dead ends: 192 [2024-11-19 06:13:07,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-19 06:13:07,882 INFO L432 NwaCegarLoop]: 249 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, 249 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-19 06:13:07,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:13:07,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-19 06:13:07,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-11-19 06:13:07,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 184 states have (on average 1.298913043478261) internal successors, (239), 186 states have internal predecessors, (239), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:13:07,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 247 transitions. [2024-11-19 06:13:07,915 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 247 transitions. Word has length 9 [2024-11-19 06:13:07,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:13:07,916 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 247 transitions. [2024-11-19 06:13:07,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:13:07,916 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 247 transitions. [2024-11-19 06:13:07,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-19 06:13:07,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:13:07,917 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:13:07,922 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-19 06:13:08,119 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-19 06:13:08,120 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:13:08,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:13:08,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1725709565, now seen corresponding path program 1 times [2024-11-19 06:13:08,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:13:08,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678728773] [2024-11-19 06:13:08,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:13:08,122 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-19 06:13:08,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:13:08,124 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-19 06:13:08,125 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-19 06:13:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:13:08,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:13:08,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:13:08,309 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:13:08,310 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:13:08,320 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 33 treesize of output 31 [2024-11-19 06:13:08,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:13:08,379 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 62 treesize of output 22 [2024-11-19 06:13:08,408 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-19 06:13:08,408 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:13:08,408 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:13:08,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678728773] [2024-11-19 06:13:08,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678728773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:13:08,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:13:08,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:13:08,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622398092] [2024-11-19 06:13:08,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:13:08,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:13:08,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:13:08,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:13:08,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:13:08,410 INFO L87 Difference]: Start difference. First operand 192 states and 247 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-19 06:13:08,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:13:08,975 INFO L93 Difference]: Finished difference Result 372 states and 483 transitions. [2024-11-19 06:13:08,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:13:08,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2024-11-19 06:13:08,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:13:08,982 INFO L225 Difference]: With dead ends: 372 [2024-11-19 06:13:08,983 INFO L226 Difference]: Without dead ends: 372 [2024-11-19 06:13:08,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-19 06:13:08,984 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 225 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:13:08,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 727 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:13:08,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2024-11-19 06:13:08,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 194. [2024-11-19 06:13:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 186 states have (on average 1.2956989247311828) internal successors, (241), 188 states have internal predecessors, (241), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:13:09,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 249 transitions. [2024-11-19 06:13:09,003 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 249 transitions. Word has length 11 [2024-11-19 06:13:09,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:13:09,003 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 249 transitions. [2024-11-19 06:13:09,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-19 06:13:09,003 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 249 transitions. [2024-11-19 06:13:09,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 06:13:09,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:13:09,005 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 06:13:09,014 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 06:13:09,205 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-19 06:13:09,206 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:13:09,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:13:09,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1334240943, now seen corresponding path program 1 times [2024-11-19 06:13:09,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:13:09,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612976194] [2024-11-19 06:13:09,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:13:09,208 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-19 06:13:09,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:13:09,210 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-19 06:13:09,211 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-19 06:13:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:13:09,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:13:09,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:13:09,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:13:09,566 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:13:09,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:13:09,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612976194] [2024-11-19 06:13:09,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [612976194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:13:09,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:13:09,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:13:09,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851761022] [2024-11-19 06:13:09,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:13:09,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:13:09,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:13:09,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:13:09,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:13:09,569 INFO L87 Difference]: Start difference. First operand 194 states and 249 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-19 06:13:09,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:13:09,672 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2024-11-19 06:13:09,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:13:09,672 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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 67 [2024-11-19 06:13:09,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:13:09,673 INFO L225 Difference]: With dead ends: 197 [2024-11-19 06:13:09,673 INFO L226 Difference]: Without dead ends: 197 [2024-11-19 06:13:09,673 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-19 06:13:09,674 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 30 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 632 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-19 06:13:09,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 632 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:13:09,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-11-19 06:13:09,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-11-19 06:13:09,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 189 states have (on average 1.2486772486772486) internal successors, (236), 191 states have internal predecessors, (236), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:13:09,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 244 transitions. [2024-11-19 06:13:09,681 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 244 transitions. Word has length 67 [2024-11-19 06:13:09,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:13:09,682 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 244 transitions. [2024-11-19 06:13:09,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-19 06:13:09,682 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 244 transitions. [2024-11-19 06:13:09,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-19 06:13:09,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:13:09,683 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-19 06:13:09,691 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-19 06:13:09,887 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-19 06:13:09,888 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:13:09,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:13:09,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1096998621, now seen corresponding path program 1 times [2024-11-19 06:13:09,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:13:09,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365555942] [2024-11-19 06:13:09,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:13:09,890 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-19 06:13:09,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:13:09,894 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-19 06:13:09,898 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-19 06:13:10,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:13:10,179 INFO L255 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:13:10,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:13:10,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:13:10,410 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:13:10,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:13:10,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1365555942] [2024-11-19 06:13:10,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1365555942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:13:10,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:13:10,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:13:10,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251473705] [2024-11-19 06:13:10,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:13:10,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:13:10,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:13:10,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:13:10,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:13:10,412 INFO L87 Difference]: Start difference. First operand 197 states and 244 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-19 06:13:10,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:13:10,822 INFO L93 Difference]: Finished difference Result 308 states and 381 transitions. [2024-11-19 06:13:10,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:13:10,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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 67 [2024-11-19 06:13:10,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:13:10,824 INFO L225 Difference]: With dead ends: 308 [2024-11-19 06:13:10,824 INFO L226 Difference]: Without dead ends: 308 [2024-11-19 06:13:10,824 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-19 06:13:10,828 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 90 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:13:10,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 490 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:13:10,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-19 06:13:10,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2024-11-19 06:13:10,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 297 states have (on average 1.245791245791246) internal successors, (370), 299 states have internal predecessors, (370), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:13:10,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 378 transitions. [2024-11-19 06:13:10,848 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 378 transitions. Word has length 67 [2024-11-19 06:13:10,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:13:10,848 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 378 transitions. [2024-11-19 06:13:10,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-19 06:13:10,849 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 378 transitions. [2024-11-19 06:13:10,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-19 06:13:10,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:13:10,854 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] [2024-11-19 06:13:10,865 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-19 06:13:11,055 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-19 06:13:11,056 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:13:11,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:13:11,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1043702760, now seen corresponding path program 1 times [2024-11-19 06:13:11,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:13:11,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125794529] [2024-11-19 06:13:11,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:13:11,060 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-19 06:13:11,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:13:11,063 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-19 06:13:11,064 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-19 06:13:11,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:13:11,427 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:13:11,429 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:13:11,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:13:11,458 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:13:11,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:13:11,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1125794529] [2024-11-19 06:13:11,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1125794529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:13:11,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:13:11,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:13:11,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789959790] [2024-11-19 06:13:11,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:13:11,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:13:11,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:13:11,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:13:11,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:13:11,460 INFO L87 Difference]: Start difference. First operand 305 states and 378 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:13:11,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:13:11,496 INFO L93 Difference]: Finished difference Result 308 states and 382 transitions. [2024-11-19 06:13:11,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:13:11,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 82 [2024-11-19 06:13:11,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:13:11,499 INFO L225 Difference]: With dead ends: 308 [2024-11-19 06:13:11,500 INFO L226 Difference]: Without dead ends: 308 [2024-11-19 06:13:11,500 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-19 06:13:11,501 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 0 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 695 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-19 06:13:11,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 695 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:13:11,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-19 06:13:11,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2024-11-19 06:13:11,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 299 states have (on average 1.2474916387959867) internal successors, (373), 302 states have internal predecessors, (373), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:13:11,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 382 transitions. [2024-11-19 06:13:11,508 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 382 transitions. Word has length 82 [2024-11-19 06:13:11,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:13:11,509 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 382 transitions. [2024-11-19 06:13:11,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:13:11,509 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 382 transitions. [2024-11-19 06:13:11,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-19 06:13:11,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:13:11,510 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:13:11,521 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-19 06:13:11,714 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-19 06:13:11,718 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:13:11,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:13:11,719 INFO L85 PathProgramCache]: Analyzing trace with hash -388445802, now seen corresponding path program 1 times [2024-11-19 06:13:11,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:13:11,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093435902] [2024-11-19 06:13:11,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:13:11,720 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-19 06:13:11,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:13:11,721 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-19 06:13:11,722 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-19 06:13:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:13:12,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:13:12,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:13:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:13:12,120 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:13:12,207 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:13:12,208 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:13:12,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093435902] [2024-11-19 06:13:12,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093435902] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:13:12,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:13:12,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 06:13:12,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275804537] [2024-11-19 06:13:12,209 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:13:12,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:13:12,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:13:12,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:13:12,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:13:12,210 INFO L87 Difference]: Start difference. First operand 308 states and 382 transitions. Second operand has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:13:12,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:13:12,410 INFO L93 Difference]: Finished difference Result 319 states and 398 transitions. [2024-11-19 06:13:12,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:13:12,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 84 [2024-11-19 06:13:12,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:13:12,412 INFO L225 Difference]: With dead ends: 319 [2024-11-19 06:13:12,412 INFO L226 Difference]: Without dead ends: 319 [2024-11-19 06:13:12,412 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-19 06:13:12,413 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 5 mSDsluCounter, 921 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:13:12,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:13:12,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2024-11-19 06:13:12,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2024-11-19 06:13:12,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 307 states have (on average 1.260586319218241) internal successors, (387), 310 states have internal predecessors, (387), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:13:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 396 transitions. [2024-11-19 06:13:12,420 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 396 transitions. Word has length 84 [2024-11-19 06:13:12,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:13:12,420 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 396 transitions. [2024-11-19 06:13:12,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.0) internal successors, (88), 8 states have internal predecessors, (88), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:13:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 396 transitions. [2024-11-19 06:13:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-19 06:13:12,422 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:13:12,422 INFO L215 NwaCegarLoop]: trace histogram [6, 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] [2024-11-19 06:13:12,439 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 (7)] Forceful destruction successful, exit code 0 [2024-11-19 06:13:12,622 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-19 06:13:12,623 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:13:12,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:13:12,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1144462136, now seen corresponding path program 2 times [2024-11-19 06:13:12,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:13:12,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515835952] [2024-11-19 06:13:12,624 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:13:12,624 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-19 06:13:12,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:13:12,627 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-19 06:13:12,628 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-19 06:13:12,901 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:13:12,901 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:13:12,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:13:12,909 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:13:12,918 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:13:12,919 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:13:12,920 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:13:12,921 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-19 06:13:12,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:13:12,983 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-19 06:13:12,999 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-19 06:13:12,999 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:13:13,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:13:13,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515835952] [2024-11-19 06:13:13,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [515835952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:13:13,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:13:13,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:13:13,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111096280] [2024-11-19 06:13:13,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:13:13,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:13:13,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:13:13,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:13:13,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:13:13,001 INFO L87 Difference]: Start difference. First operand 317 states and 396 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:13:13,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:13:13,459 INFO L93 Difference]: Finished difference Result 477 states and 607 transitions. [2024-11-19 06:13:13,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:13:13,460 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2024-11-19 06:13:13,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:13:13,461 INFO L225 Difference]: With dead ends: 477 [2024-11-19 06:13:13,461 INFO L226 Difference]: Without dead ends: 477 [2024-11-19 06:13:13,462 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 85 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-19 06:13:13,462 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 207 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:13:13,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 697 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:13:13,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2024-11-19 06:13:13,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 319. [2024-11-19 06:13:13,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 309 states have (on average 1.2588996763754046) internal successors, (389), 312 states have internal predecessors, (389), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:13:13,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 398 transitions. [2024-11-19 06:13:13,470 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 398 transitions. Word has length 88 [2024-11-19 06:13:13,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:13:13,470 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 398 transitions. [2024-11-19 06:13:13,471 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), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:13:13,471 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 398 transitions. [2024-11-19 06:13:13,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 06:13:13,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:13:13,472 INFO L215 NwaCegarLoop]: trace histogram [6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:13:13,477 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-19 06:13:13,672 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-19 06:13:13,673 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:13:13,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:13:13,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1070507670, now seen corresponding path program 1 times [2024-11-19 06:13:13,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:13:13,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686654712] [2024-11-19 06:13:13,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:13:13,674 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-19 06:13:13,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:13:13,675 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-19 06:13:13,676 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-19 06:13:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:13:14,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:13:14,138 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:13:14,203 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:13:14,204 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:13:14,390 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:13:14,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:13:14,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686654712] [2024-11-19 06:13:14,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686654712] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:13:14,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:13:14,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-19 06:13:14,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876138103] [2024-11-19 06:13:14,391 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:13:14,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:13:14,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:13:14,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:13:14,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:13:14,397 INFO L87 Difference]: Start difference. First operand 319 states and 398 transitions. Second operand has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:13:14,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:13:14,948 INFO L93 Difference]: Finished difference Result 334 states and 420 transitions. [2024-11-19 06:13:14,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:13:14,948 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 125 [2024-11-19 06:13:14,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:13:14,950 INFO L225 Difference]: With dead ends: 334 [2024-11-19 06:13:14,950 INFO L226 Difference]: Without dead ends: 330 [2024-11-19 06:13:14,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 236 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-19 06:13:14,951 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 8 mSDsluCounter, 1386 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1619 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:13:14,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1619 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:13:14,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-19 06:13:14,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2024-11-19 06:13:14,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 318 states have (on average 1.2610062893081762) internal successors, (401), 321 states have internal predecessors, (401), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:13:14,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 410 transitions. [2024-11-19 06:13:14,956 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 410 transitions. Word has length 125 [2024-11-19 06:13:14,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:13:14,957 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 410 transitions. [2024-11-19 06:13:14,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 9.285714285714286) internal successors, (130), 14 states have internal predecessors, (130), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:13:14,957 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 410 transitions. [2024-11-19 06:13:14,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 06:13:14,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:13:14,958 INFO L215 NwaCegarLoop]: trace histogram [15, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:13:14,977 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-19 06:13:15,158 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-19 06:13:15,159 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:13:15,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:13:15,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1989466845, now seen corresponding path program 2 times [2024-11-19 06:13:15,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:13:15,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977350129] [2024-11-19 06:13:15,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:13:15,160 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-19 06:13:15,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:13:15,161 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-19 06:13:15,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 06:13:15,424 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:13:15,424 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:13:15,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:13:15,434 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:13:15,466 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2024-11-19 06:13:15,466 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:13:15,466 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:13:15,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977350129] [2024-11-19 06:13:15,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977350129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:13:15,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:13:15,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:13:15,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782055966] [2024-11-19 06:13:15,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:13:15,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:13:15,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:13:15,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:13:15,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:13:15,471 INFO L87 Difference]: Start difference. First operand 328 states and 410 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:13:15,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:13:15,559 INFO L93 Difference]: Finished difference Result 334 states and 400 transitions. [2024-11-19 06:13:15,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:13:15,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 134 [2024-11-19 06:13:15,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:13:15,560 INFO L225 Difference]: With dead ends: 334 [2024-11-19 06:13:15,560 INFO L226 Difference]: Without dead ends: 334 [2024-11-19 06:13:15,560 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 131 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-19 06:13:15,561 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 30 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 599 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-19 06:13:15,561 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 599 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:13:15,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-19 06:13:15,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2024-11-19 06:13:15,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 324 states have (on average 1.2067901234567902) internal successors, (391), 327 states have internal predecessors, (391), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:13:15,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 400 transitions. [2024-11-19 06:13:15,566 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 400 transitions. Word has length 134 [2024-11-19 06:13:15,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:13:15,567 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 400 transitions. [2024-11-19 06:13:15,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:13:15,567 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 400 transitions. [2024-11-19 06:13:15,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 06:13:15,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:13:15,568 INFO L215 NwaCegarLoop]: trace histogram [15, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:13:15,586 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-19 06:13:15,768 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-19 06:13:15,769 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:13:15,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:13:15,769 INFO L85 PathProgramCache]: Analyzing trace with hash -639537001, now seen corresponding path program 1 times [2024-11-19 06:13:15,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:13:15,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81232321] [2024-11-19 06:13:15,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:13:15,770 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-19 06:13:15,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:13:15,773 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-19 06:13:15,773 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-19 06:13:16,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:13:16,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:13:16,264 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:13:16,463 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 71 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 06:13:16,464 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:13:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 123 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 06:13:16,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:13:16,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81232321] [2024-11-19 06:13:16,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81232321] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:13:16,944 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:13:16,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-19 06:13:16,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900460701] [2024-11-19 06:13:16,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:13:16,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 06:13:16,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:13:16,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 06:13:16,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-19 06:13:16,946 INFO L87 Difference]: Start difference. First operand 334 states and 400 transitions. Second operand has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:13:18,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:13:18,757 INFO L93 Difference]: Finished difference Result 358 states and 440 transitions. [2024-11-19 06:13:18,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 06:13:18,757 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 134 [2024-11-19 06:13:18,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:13:18,763 INFO L225 Difference]: With dead ends: 358 [2024-11-19 06:13:18,763 INFO L226 Difference]: Without dead ends: 354 [2024-11-19 06:13:18,764 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 06:13:18,765 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 13 mSDsluCounter, 2424 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2646 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 06:13:18,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2646 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 06:13:18,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2024-11-19 06:13:18,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2024-11-19 06:13:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 342 states have (on average 1.213450292397661) internal successors, (415), 345 states have internal predecessors, (415), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:13:18,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 424 transitions. [2024-11-19 06:13:18,781 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 424 transitions. Word has length 134 [2024-11-19 06:13:18,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:13:18,781 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 424 transitions. [2024-11-19 06:13:18,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.461538461538462) internal successors, (142), 26 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:13:18,782 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 424 transitions. [2024-11-19 06:13:18,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-19 06:13:18,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:13:18,787 INFO L215 NwaCegarLoop]: trace histogram [33, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:13:18,799 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-19 06:13:18,988 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-19 06:13:18,988 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:13:18,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:13:18,992 INFO L85 PathProgramCache]: Analyzing trace with hash -747182601, now seen corresponding path program 2 times [2024-11-19 06:13:18,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:13:18,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934421089] [2024-11-19 06:13:18,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:13:18,993 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-19 06:13:18,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:13:18,994 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-19 06:13:18,995 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-19 06:13:19,337 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 06:13:19,337 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:13:19,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:13:19,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:13:19,401 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-11-19 06:13:19,401 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:13:19,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:13:19,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934421089] [2024-11-19 06:13:19,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [934421089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:13:19,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:13:19,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:13:19,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757642455] [2024-11-19 06:13:19,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:13:19,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:13:19,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:13:19,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:13:19,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:13:19,403 INFO L87 Difference]: Start difference. First operand 352 states and 424 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:13:19,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:13:19,463 INFO L93 Difference]: Finished difference Result 352 states and 418 transitions. [2024-11-19 06:13:19,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:13:19,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 152 [2024-11-19 06:13:19,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:13:19,465 INFO L225 Difference]: With dead ends: 352 [2024-11-19 06:13:19,465 INFO L226 Difference]: Without dead ends: 352 [2024-11-19 06:13:19,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 150 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-19 06:13:19,466 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 0 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:13:19,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 416 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:13:19,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2024-11-19 06:13:19,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2024-11-19 06:13:19,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 342 states have (on average 1.195906432748538) internal successors, (409), 345 states have internal predecessors, (409), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:13:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 418 transitions. [2024-11-19 06:13:19,473 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 418 transitions. Word has length 152 [2024-11-19 06:13:19,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:13:19,473 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 418 transitions. [2024-11-19 06:13:19,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:13:19,474 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 418 transitions. [2024-11-19 06:13:19,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-19 06:13:19,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:13:19,475 INFO L215 NwaCegarLoop]: trace histogram [33, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:13:19,484 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-19 06:13:19,675 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-19 06:13:19,676 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:13:19,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:13:19,676 INFO L85 PathProgramCache]: Analyzing trace with hash 273885753, now seen corresponding path program 1 times [2024-11-19 06:13:19,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:13:19,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710337267] [2024-11-19 06:13:19,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:13:19,677 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-19 06:13:19,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:13:19,682 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-19 06:13:19,684 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-19 06:13:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:13:20,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 897 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 06:13:20,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:13:20,837 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 281 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-19 06:13:20,837 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:13:22,495 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 2 proven. 531 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-19 06:13:22,495 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:13:22,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710337267] [2024-11-19 06:13:22,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710337267] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:13:22,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:13:22,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-19 06:13:22,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173113197] [2024-11-19 06:13:22,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:13:22,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-19 06:13:22,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:13:22,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 06:13:22,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 06:13:22,500 INFO L87 Difference]: Start difference. First operand 352 states and 418 transitions. Second operand has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:13:29,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:13:29,458 INFO L93 Difference]: Finished difference Result 392 states and 490 transitions. [2024-11-19 06:13:29,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-19 06:13:29,460 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 152 [2024-11-19 06:13:29,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:13:29,461 INFO L225 Difference]: With dead ends: 392 [2024-11-19 06:13:29,461 INFO L226 Difference]: Without dead ends: 388 [2024-11-19 06:13:29,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-19 06:13:29,465 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 26 mSDsluCounter, 5498 mSDsCounter, 0 mSdLazyCounter, 1945 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 5720 SdHoareTripleChecker+Invalid, 1994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:13:29,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 5720 Invalid, 1994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1945 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-19 06:13:29,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-19 06:13:29,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 386. [2024-11-19 06:13:29,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 376 states have (on average 1.2101063829787233) internal successors, (455), 379 states have internal predecessors, (455), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:13:29,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 464 transitions. [2024-11-19 06:13:29,475 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 464 transitions. Word has length 152 [2024-11-19 06:13:29,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:13:29,475 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 464 transitions. [2024-11-19 06:13:29,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.32) internal successors, (166), 50 states have internal predecessors, (166), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:13:29,475 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 464 transitions. [2024-11-19 06:13:29,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-19 06:13:29,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:13:29,477 INFO L215 NwaCegarLoop]: trace histogram [67, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:13:29,491 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-19 06:13:29,680 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-19 06:13:29,681 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:13:29,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:13:29,681 INFO L85 PathProgramCache]: Analyzing trace with hash 94876633, now seen corresponding path program 2 times [2024-11-19 06:13:29,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:13:29,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003307384] [2024-11-19 06:13:29,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:13:29,682 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-19 06:13:29,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:13:29,685 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-19 06:13:29,686 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-19 06:13:30,787 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:13:30,787 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:13:30,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 06:13:30,831 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:13:31,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-19 06:13:31,274 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:13:33,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-19 06:13:33,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:13:33,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003307384] [2024-11-19 06:13:33,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003307384] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:13:33,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:13:33,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-19 06:13:33,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527947796] [2024-11-19 06:13:33,450 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:13:33,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-19 06:13:33,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:13:33,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-19 06:13:33,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-19 06:13:33,452 INFO L87 Difference]: Start difference. First operand 386 states and 464 transitions. Second operand has 52 states, 52 states have (on average 3.1538461538461537) internal successors, (164), 52 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:13:41,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:13:41,302 INFO L93 Difference]: Finished difference Result 415 states and 518 transitions. [2024-11-19 06:13:41,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-19 06:13:41,303 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.1538461538461537) internal successors, (164), 52 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 186 [2024-11-19 06:13:41,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:13:41,304 INFO L225 Difference]: With dead ends: 415 [2024-11-19 06:13:41,304 INFO L226 Difference]: Without dead ends: 415 [2024-11-19 06:13:41,307 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-19 06:13:41,308 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 27 mSDsluCounter, 5477 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 5698 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:13:41,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 5698 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-19 06:13:41,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-11-19 06:13:41,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 411. [2024-11-19 06:13:41,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 401 states have (on average 1.259351620947631) internal successors, (505), 404 states have internal predecessors, (505), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:13:41,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 514 transitions. [2024-11-19 06:13:41,330 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 514 transitions. Word has length 186 [2024-11-19 06:13:41,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:13:41,330 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 514 transitions. [2024-11-19 06:13:41,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.1538461538461537) internal successors, (164), 52 states have internal predecessors, (164), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:13:41,331 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 514 transitions. [2024-11-19 06:13:41,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-19 06:13:41,332 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:13:41,332 INFO L215 NwaCegarLoop]: trace histogram [92, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:13:41,353 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-19 06:13:41,532 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-19 06:13:41,533 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:13:41,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:13:41,534 INFO L85 PathProgramCache]: Analyzing trace with hash -402225536, now seen corresponding path program 3 times [2024-11-19 06:13:41,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:13:41,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574335812] [2024-11-19 06:13:41,535 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:13:41,535 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-19 06:13:41,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:13:41,538 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-19 06:13:41,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 06:13:42,111 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 06:13:42,111 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:13:42,124 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:13:42,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:13:42,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4374 trivial. 0 not checked. [2024-11-19 06:13:42,340 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:13:42,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:13:42,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574335812] [2024-11-19 06:13:42,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574335812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:13:42,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:13:42,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:13:42,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540267716] [2024-11-19 06:13:42,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:13:42,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:13:42,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:13:42,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:13:42,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:13:42,342 INFO L87 Difference]: Start difference. First operand 411 states and 514 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:13:46,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 06:13:50,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 06:13:52,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 06:13:53,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:13:53,328 INFO L93 Difference]: Finished difference Result 502 states and 621 transitions. [2024-11-19 06:13:53,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:13:53,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 211 [2024-11-19 06:13:53,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:13:53,332 INFO L225 Difference]: With dead ends: 502 [2024-11-19 06:13:53,332 INFO L226 Difference]: Without dead ends: 502 [2024-11-19 06:13:53,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 209 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-19 06:13:53,333 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 396 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:13:53,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 387 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 2 Unknown, 0 Unchecked, 11.0s Time] [2024-11-19 06:13:53,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-19 06:13:53,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 499. [2024-11-19 06:13:53,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 489 states have (on average 1.2453987730061349) internal successors, (609), 492 states have internal predecessors, (609), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:13:53,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 618 transitions. [2024-11-19 06:13:53,357 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 618 transitions. Word has length 211 [2024-11-19 06:13:53,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:13:53,357 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 618 transitions. [2024-11-19 06:13:53,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:13:53,357 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 618 transitions. [2024-11-19 06:13:53,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-19 06:13:53,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:13:53,359 INFO L215 NwaCegarLoop]: trace histogram [92, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 06:13:53,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-19 06:13:53,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:13:53,563 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:13:53,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:13:53,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1038220470, now seen corresponding path program 1 times [2024-11-19 06:13:53,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:13:53,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367818017] [2024-11-19 06:13:53,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:13:53,565 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-19 06:13:53,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:13:53,566 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:13:53,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 06:13:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:13:55,093 INFO L255 TraceCheckSpWp]: Trace formula consists of 1562 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-19 06:13:55,097 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:13:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2209 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-19 06:13:56,783 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:14:02,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2209 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-19 06:14:02,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:14:02,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367818017] [2024-11-19 06:14:02,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367818017] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:14:02,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:14:02,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-19 06:14:02,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518376248] [2024-11-19 06:14:02,594 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:14:02,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-19 06:14:02,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:14:02,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-19 06:14:02,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-19 06:14:02,598 INFO L87 Difference]: Start difference. First operand 499 states and 618 transitions. Second operand has 102 states, 102 states have (on average 2.176470588235294) internal successors, (222), 102 states have internal predecessors, (222), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)