./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a3326bc22943076798f4c55311213b2a5f9b1e03e68dc17c2ac5a3393252251 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:06:30,553 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:06:30,612 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-12 13:06:30,618 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:06:30,618 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:06:30,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:06:30,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:06:30,640 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:06:30,641 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:06:30,642 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:06:30,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:06:30,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:06:30,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:06:30,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:06:30,644 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:06:30,645 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:06:30,645 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 13:06:30,646 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:06:30,646 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:06:30,646 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:06:30,650 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:06:30,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 13:06:30,651 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:06:30,651 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:06:30,651 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:06:30,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 13:06:30,651 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:06:30,652 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:06:30,652 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:06:30,652 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:06:30,652 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 13:06:30,652 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:06:30,653 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:06:30,653 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:06:30,653 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:06:30,653 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:06:30,653 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:06:30,653 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:06:30,654 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:06:30,654 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 13:06:30,654 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 13:06:30,654 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:06:30,654 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:06:30,655 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:06:30,655 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:06:30,655 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 -> 2a3326bc22943076798f4c55311213b2a5f9b1e03e68dc17c2ac5a3393252251 [2024-11-12 13:06:30,857 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:06:30,884 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:06:30,886 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:06:30,887 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:06:30,887 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:06:30,888 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i [2024-11-12 13:06:32,196 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:06:32,454 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:06:32,455 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i [2024-11-12 13:06:32,478 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/192911bd8/cc0fb530b27746608b931abb652e28c4/FLAGebe59ac31 [2024-11-12 13:06:32,752 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/192911bd8/cc0fb530b27746608b931abb652e28c4 [2024-11-12 13:06:32,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:06:32,755 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:06:32,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:06:32,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:06:32,762 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:06:32,763 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:06:32" (1/1) ... [2024-11-12 13:06:32,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e831200 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:32, skipping insertion in model container [2024-11-12 13:06:32,763 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:06:32" (1/1) ... [2024-11-12 13:06:32,808 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:06:33,222 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:33,257 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:33,261 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:33,266 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:33,274 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:33,309 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:33,310 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:33,312 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:33,312 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:33,314 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:33,317 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:33,320 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:33,322 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:33,323 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:33,325 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:33,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:06:33,353 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-12 13:06:33,357 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5bd38109 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:33, skipping insertion in model container [2024-11-12 13:06:33,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:06:33,358 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-12 13:06:33,360 INFO L158 Benchmark]: Toolchain (without parser) took 604.33ms. Allocated memory was 163.6MB in the beginning and 243.3MB in the end (delta: 79.7MB). Free memory was 87.8MB in the beginning and 204.7MB in the end (delta: -116.9MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-11-12 13:06:33,361 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 163.6MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 13:06:33,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 602.32ms. Allocated memory was 163.6MB in the beginning and 243.3MB in the end (delta: 79.7MB). Free memory was 87.6MB in the beginning and 204.7MB in the end (delta: -117.1MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2024-11-12 13:06:33,363 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.10ms. Allocated memory is still 163.6MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 602.32ms. Allocated memory was 163.6MB in the beginning and 243.3MB in the end (delta: 79.7MB). Free memory was 87.6MB in the beginning and 204.7MB in the end (delta: -117.1MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 833]: 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_SFH_test2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a3326bc22943076798f4c55311213b2a5f9b1e03e68dc17c2ac5a3393252251 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 13:06:35,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 13:06:35,079 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-12 13:06:35,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 13:06:35,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 13:06:35,114 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 13:06:35,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 13:06:35,115 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 13:06:35,115 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 13:06:35,115 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 13:06:35,116 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 13:06:35,116 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 13:06:35,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 13:06:35,116 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 13:06:35,116 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 13:06:35,117 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 13:06:35,117 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 13:06:35,117 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 13:06:35,118 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 13:06:35,118 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 13:06:35,118 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 13:06:35,120 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 13:06:35,122 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 13:06:35,122 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 13:06:35,122 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 13:06:35,123 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 13:06:35,123 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 13:06:35,123 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 13:06:35,123 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 13:06:35,123 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 13:06:35,123 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 13:06:35,123 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 13:06:35,124 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 13:06:35,124 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 13:06:35,124 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 13:06:35,124 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 13:06:35,124 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 13:06:35,124 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 13:06:35,125 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:06:35,125 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 13:06:35,125 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 13:06:35,126 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 13:06:35,126 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 13:06:35,126 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 13:06:35,126 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 13:06:35,126 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 13:06:35,127 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 13:06:35,127 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 -> 2a3326bc22943076798f4c55311213b2a5f9b1e03e68dc17c2ac5a3393252251 [2024-11-12 13:06:35,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 13:06:35,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 13:06:35,393 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 13:06:35,395 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 13:06:35,396 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 13:06:35,397 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i [2024-11-12 13:06:36,801 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 13:06:37,058 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 13:06:37,059 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test2-2.i [2024-11-12 13:06:37,076 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660bc027e/a1f9f24c8693462f898feb59ba588592/FLAG6194afa80 [2024-11-12 13:06:37,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/660bc027e/a1f9f24c8693462f898feb59ba588592 [2024-11-12 13:06:37,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 13:06:37,095 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 13:06:37,096 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 13:06:37,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 13:06:37,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 13:06:37,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:06:37" (1/1) ... [2024-11-12 13:06:37,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bc091e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:37, skipping insertion in model container [2024-11-12 13:06:37,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:06:37" (1/1) ... [2024-11-12 13:06:37,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:06:37,506 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,539 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,542 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,545 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,549 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,606 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,610 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,613 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,613 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,615 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,617 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,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-12 13:06:37,619 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,619 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,622 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,628 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:06:37,642 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-12 13:06:37,650 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 13:06:37,676 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,687 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,689 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,691 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,694 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,713 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,717 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,719 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,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-12 13:06:37,721 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,726 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,726 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,727 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,727 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,731 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 13:06:37,734 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:06:37,737 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 13:06:37,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 13:06:37,853 INFO L204 MainTranslator]: Completed translation [2024-11-12 13:06:37,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:37 WrapperNode [2024-11-12 13:06:37,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 13:06:37,855 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 13:06:37,855 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 13:06:37,855 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 13:06:37,860 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:37" (1/1) ... [2024-11-12 13:06:37,889 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:37" (1/1) ... [2024-11-12 13:06:37,947 INFO L138 Inliner]: procedures = 211, calls = 280, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1063 [2024-11-12 13:06:37,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 13:06:37,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 13:06:37,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 13:06:37,948 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 13:06:37,958 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:37" (1/1) ... [2024-11-12 13:06:37,958 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:37" (1/1) ... [2024-11-12 13:06:37,974 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:37" (1/1) ... [2024-11-12 13:06:38,036 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [220, 2, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2, 0]. The 54 writes are split as follows [50, 0, 4]. [2024-11-12 13:06:38,038 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:37" (1/1) ... [2024-11-12 13:06:38,038 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:37" (1/1) ... [2024-11-12 13:06:38,061 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:37" (1/1) ... [2024-11-12 13:06:38,072 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:37" (1/1) ... [2024-11-12 13:06:38,079 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:37" (1/1) ... [2024-11-12 13:06:38,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:37" (1/1) ... [2024-11-12 13:06:38,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 13:06:38,103 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 13:06:38,103 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 13:06:38,103 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 13:06:38,103 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:37" (1/1) ... [2024-11-12 13:06:38,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 13:06:38,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 13:06:38,147 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 13:06:38,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 13:06:38,187 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-12 13:06:38,187 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-12 13:06:38,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 13:06:38,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 13:06:38,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-12 13:06:38,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 13:06:38,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 13:06:38,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-12 13:06:38,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-12 13:06:38,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-12 13:06:38,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-12 13:06:38,188 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-12 13:06:38,189 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-12 13:06:38,189 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-12 13:06:38,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 13:06:38,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 13:06:38,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 13:06:38,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 13:06:38,189 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 13:06:38,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 13:06:38,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 13:06:38,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-12 13:06:38,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 13:06:38,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 13:06:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-12 13:06:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 13:06:38,191 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 13:06:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 13:06:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 13:06:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 13:06:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 13:06:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 13:06:38,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 13:06:38,191 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 13:06:38,383 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 13:06:38,385 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 13:06:45,808 INFO L? ?]: Removed 143 outVars from TransFormulas that were not future-live. [2024-11-12 13:06:45,809 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 13:06:45,827 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 13:06:45,827 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-12 13:06:45,828 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:06:45 BoogieIcfgContainer [2024-11-12 13:06:45,828 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 13:06:45,829 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 13:06:45,829 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 13:06:45,832 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 13:06:45,832 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:06:37" (1/3) ... [2024-11-12 13:06:45,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e04d0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:06:45, skipping insertion in model container [2024-11-12 13:06:45,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:06:37" (2/3) ... [2024-11-12 13:06:45,833 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e04d0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:06:45, skipping insertion in model container [2024-11-12 13:06:45,833 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:06:45" (3/3) ... [2024-11-12 13:06:45,835 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test2-2.i [2024-11-12 13:06:45,850 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 13:06:45,850 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 13:06:45,895 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 13:06:45,901 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;@3260760, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 13:06:45,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 13:06:45,905 INFO L276 IsEmpty]: Start isEmpty. Operand has 217 states, 201 states have (on average 1.6616915422885572) internal successors, (334), 210 states have internal predecessors, (334), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-12 13:06:45,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 13:06:45,912 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:06:45,912 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:06:45,913 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:06:45,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:06:45,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1666316162, now seen corresponding path program 1 times [2024-11-12 13:06:45,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:06:45,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620144829] [2024-11-12 13:06:45,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:06:45,927 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:06:45,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:06:45,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:06:45,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 13:06:46,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:06:46,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 13:06:46,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:06:46,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:06:46,124 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:06:46,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:06:46,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [620144829] [2024-11-12 13:06:46,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [620144829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:06:46,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:06:46,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 13:06:46,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216300718] [2024-11-12 13:06:46,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:06:46,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 13:06:46,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:06:46,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 13:06:46,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 13:06:46,155 INFO L87 Difference]: Start difference. First operand has 217 states, 201 states have (on average 1.6616915422885572) internal successors, (334), 210 states have internal predecessors, (334), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:06:46,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:06:46,191 INFO L93 Difference]: Finished difference Result 215 states and 282 transitions. [2024-11-12 13:06:46,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 13:06:46,196 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-12 13:06:46,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:06:46,211 INFO L225 Difference]: With dead ends: 215 [2024-11-12 13:06:46,211 INFO L226 Difference]: Without dead ends: 213 [2024-11-12 13:06:46,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 13:06:46,220 INFO L435 NwaCegarLoop]: 282 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, 282 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-12 13:06:46,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:06:46,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-12 13:06:46,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-11-12 13:06:46,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 199 states have (on average 1.3165829145728642) internal successors, (262), 206 states have internal predecessors, (262), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-12 13:06:46,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 280 transitions. [2024-11-12 13:06:46,280 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 280 transitions. Word has length 11 [2024-11-12 13:06:46,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:06:46,280 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 280 transitions. [2024-11-12 13:06:46,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:06:46,280 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 280 transitions. [2024-11-12 13:06:46,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 13:06:46,281 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:06:46,281 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:06:46,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 13:06:46,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:06:46,482 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:06:46,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:06:46,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1435559136, now seen corresponding path program 1 times [2024-11-12 13:06:46,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:06:46,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [439176569] [2024-11-12 13:06:46,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:06:46,483 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:06:46,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:06:46,485 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:06:46,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 13:06:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:06:46,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 13:06:46,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:06:46,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:06:46,719 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:06:46,720 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:06:46,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [439176569] [2024-11-12 13:06:46,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [439176569] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:06:46,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:06:46,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:06:46,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795260074] [2024-11-12 13:06:46,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:06:46,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:06:46,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:06:46,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:06:46,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:06:46,723 INFO L87 Difference]: Start difference. First operand 213 states and 280 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:06:47,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:06:47,405 INFO L93 Difference]: Finished difference Result 345 states and 458 transitions. [2024-11-12 13:06:47,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:06:47,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-12 13:06:47,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:06:47,409 INFO L225 Difference]: With dead ends: 345 [2024-11-12 13:06:47,409 INFO L226 Difference]: Without dead ends: 345 [2024-11-12 13:06:47,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:06:47,410 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 158 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 13:06:47,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 522 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 13:06:47,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-12 13:06:47,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 313. [2024-11-12 13:06:47,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 294 states have (on average 1.3231292517006803) internal successors, (389), 306 states have internal predecessors, (389), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 13:06:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 417 transitions. [2024-11-12 13:06:47,429 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 417 transitions. Word has length 13 [2024-11-12 13:06:47,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:06:47,429 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 417 transitions. [2024-11-12 13:06:47,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:06:47,433 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 417 transitions. [2024-11-12 13:06:47,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-12 13:06:47,434 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:06:47,434 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:06:47,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 13:06:47,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:06:47,637 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:06:47,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:06:47,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1433712094, now seen corresponding path program 1 times [2024-11-12 13:06:47,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:06:47,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273172509] [2024-11-12 13:06:47,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:06:47,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:06:47,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:06:47,639 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:06:47,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 13:06:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:06:47,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 13:06:47,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:06:47,801 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:06:47,803 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:06:47,803 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:06:47,816 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-12 13:06:47,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:06:47,937 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-12 13:06:47,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 13:06:47,974 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:06:47,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:06:47,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273172509] [2024-11-12 13:06:47,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273172509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:06:47,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:06:47,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:06:47,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524629285] [2024-11-12 13:06:47,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:06:47,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:06:47,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:06:47,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:06:47,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:06:47,977 INFO L87 Difference]: Start difference. First operand 313 states and 417 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:06:48,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:06:48,556 INFO L93 Difference]: Finished difference Result 482 states and 651 transitions. [2024-11-12 13:06:48,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:06:48,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-12 13:06:48,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:06:48,559 INFO L225 Difference]: With dead ends: 482 [2024-11-12 13:06:48,559 INFO L226 Difference]: Without dead ends: 482 [2024-11-12 13:06:48,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 13:06:48,560 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 241 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-12 13:06:48,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 768 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-12 13:06:48,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-12 13:06:48,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 312. [2024-11-12 13:06:48,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 293 states have (on average 1.3208191126279865) internal successors, (387), 305 states have internal predecessors, (387), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 13:06:48,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 415 transitions. [2024-11-12 13:06:48,593 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 415 transitions. Word has length 13 [2024-11-12 13:06:48,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:06:48,594 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 415 transitions. [2024-11-12 13:06:48,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 13:06:48,594 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 415 transitions. [2024-11-12 13:06:48,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-12 13:06:48,597 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:06:48,598 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:06:48,607 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-12 13:06:48,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:06:48,799 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:06:48,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:06:48,800 INFO L85 PathProgramCache]: Analyzing trace with hash 2124901487, now seen corresponding path program 1 times [2024-11-12 13:06:48,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:06:48,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [245895378] [2024-11-12 13:06:48,801 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:06:48,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:06:48,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:06:48,804 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:06:48,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 13:06:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:06:49,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 13:06:49,181 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:06:49,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:06:49,210 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:06:49,210 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:06:49,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [245895378] [2024-11-12 13:06:49,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [245895378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:06:49,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:06:49,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:06:49,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93853367] [2024-11-12 13:06:49,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:06:49,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:06:49,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:06:49,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:06:49,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:06:49,215 INFO L87 Difference]: Start difference. First operand 312 states and 415 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-12 13:06:49,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:06:49,351 INFO L93 Difference]: Finished difference Result 318 states and 405 transitions. [2024-11-12 13:06:49,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:06:49,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 84 [2024-11-12 13:06:49,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:06:49,354 INFO L225 Difference]: With dead ends: 318 [2024-11-12 13:06:49,354 INFO L226 Difference]: Without dead ends: 318 [2024-11-12 13:06:49,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 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-12 13:06:49,355 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 30 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 731 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-12 13:06:49,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 731 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:06:49,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-12 13:06:49,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2024-11-12 13:06:49,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 299 states have (on average 1.2608695652173914) internal successors, (377), 311 states have internal predecessors, (377), 15 states have call successors, (15), 3 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-12 13:06:49,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 405 transitions. [2024-11-12 13:06:49,367 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 405 transitions. Word has length 84 [2024-11-12 13:06:49,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:06:49,367 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 405 transitions. [2024-11-12 13:06:49,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-12 13:06:49,368 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 405 transitions. [2024-11-12 13:06:49,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2024-11-12 13:06:49,370 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:06:49,370 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:06:49,381 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-12 13:06:49,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:06:49,573 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:06:49,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:06:49,573 INFO L85 PathProgramCache]: Analyzing trace with hash 2108090491, now seen corresponding path program 1 times [2024-11-12 13:06:49,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:06:49,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647679325] [2024-11-12 13:06:49,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:06:49,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:06:49,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:06:49,577 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:06:49,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 13:06:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:06:49,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 13:06:49,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:06:49,976 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-12 13:06:49,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:06:49,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:06:49,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647679325] [2024-11-12 13:06:49,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647679325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:06:49,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:06:49,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:06:49,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982647399] [2024-11-12 13:06:49,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:06:49,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:06:49,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:06:49,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:06:49,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:06:49,978 INFO L87 Difference]: Start difference. First operand 318 states and 405 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-12 13:06:50,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:06:50,033 INFO L93 Difference]: Finished difference Result 321 states and 409 transitions. [2024-11-12 13:06:50,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:06:50,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 84 [2024-11-12 13:06:50,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:06:50,036 INFO L225 Difference]: With dead ends: 321 [2024-11-12 13:06:50,036 INFO L226 Difference]: Without dead ends: 321 [2024-11-12 13:06:50,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:06:50,037 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 0 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 794 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-12 13:06:50,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 794 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 13:06:50,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-12 13:06:50,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2024-11-12 13:06:50,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 301 states have (on average 1.2624584717607974) internal successors, (380), 314 states have internal predecessors, (380), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-12 13:06:50,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 409 transitions. [2024-11-12 13:06:50,044 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 409 transitions. Word has length 84 [2024-11-12 13:06:50,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:06:50,045 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 409 transitions. [2024-11-12 13:06:50,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-12 13:06:50,045 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 409 transitions. [2024-11-12 13:06:50,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-12 13:06:50,047 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:06:50,047 INFO L218 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, 1, 1] [2024-11-12 13:06:50,057 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-12 13:06:50,247 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-12 13:06:50,248 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:06:50,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:06:50,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1761488761, now seen corresponding path program 1 times [2024-11-12 13:06:50,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:06:50,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690156204] [2024-11-12 13:06:50,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:06:50,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:06:50,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:06:50,252 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-12 13:06:50,253 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-12 13:06:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:06:50,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 13:06:50,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:06:50,675 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-12 13:06:50,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:06:50,763 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-12 13:06:50,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:06:50,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690156204] [2024-11-12 13:06:50,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690156204] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:06:50,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:06:50,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-12 13:06:50,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114838081] [2024-11-12 13:06:50,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:06:50,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 13:06:50,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:06:50,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 13:06:50,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 13:06:50,765 INFO L87 Difference]: Start difference. First operand 321 states and 409 transitions. Second operand has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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-12 13:06:50,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:06:50,950 INFO L93 Difference]: Finished difference Result 332 states and 425 transitions. [2024-11-12 13:06:50,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 13:06:50,955 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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 86 [2024-11-12 13:06:50,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:06:50,956 INFO L225 Difference]: With dead ends: 332 [2024-11-12 13:06:50,956 INFO L226 Difference]: Without dead ends: 332 [2024-11-12 13:06:50,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 164 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-12 13:06:50,957 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 5 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:06:50,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1058 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:06:50,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-12 13:06:50,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2024-11-12 13:06:50,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 309 states have (on average 1.2750809061488673) internal successors, (394), 322 states have internal predecessors, (394), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 5 states have call predecessors, (14), 13 states have call successors, (14) [2024-11-12 13:06:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 423 transitions. [2024-11-12 13:06:50,964 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 423 transitions. Word has length 86 [2024-11-12 13:06:50,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:06:50,964 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 423 transitions. [2024-11-12 13:06:50,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.25) internal successors, (90), 8 states have internal predecessors, (90), 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-12 13:06:50,964 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 423 transitions. [2024-11-12 13:06:50,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-12 13:06:50,965 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:06:50,966 INFO L218 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] [2024-11-12 13:06:50,976 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-12 13:06:51,166 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-12 13:06:51,166 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:06:51,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:06:51,167 INFO L85 PathProgramCache]: Analyzing trace with hash 249711771, now seen corresponding path program 2 times [2024-11-12 13:06:51,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:06:51,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590016379] [2024-11-12 13:06:51,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:06:51,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:06:51,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:06:51,170 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:06:51,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 13:06:51,382 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 13:06:51,382 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:06:51,384 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 13:06:51,387 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:06:51,440 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-12 13:06:51,440 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:06:51,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:06:51,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590016379] [2024-11-12 13:06:51,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590016379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:06:51,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:06:51,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:06:51,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121361883] [2024-11-12 13:06:51,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:06:51,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:06:51,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:06:51,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:06:51,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:06:51,442 INFO L87 Difference]: Start difference. First operand 330 states and 423 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-12 13:06:55,807 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-12 13:06:59,814 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-12 13:07:02,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:07:02,353 INFO L93 Difference]: Finished difference Result 473 states and 618 transitions. [2024-11-12 13:07:02,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:07:02,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 90 [2024-11-12 13:07:02,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:07:02,356 INFO L225 Difference]: With dead ends: 473 [2024-11-12 13:07:02,356 INFO L226 Difference]: Without dead ends: 473 [2024-11-12 13:07:02,356 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 88 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-12 13:07:02,358 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 575 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 16 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2024-11-12 13:07:02,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 460 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 119 Invalid, 2 Unknown, 0 Unchecked, 10.9s Time] [2024-11-12 13:07:02,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-12 13:07:02,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 448. [2024-11-12 13:07:02,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 421 states have (on average 1.2874109263657958) internal successors, (542), 439 states have internal predecessors, (542), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-11-12 13:07:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 584 transitions. [2024-11-12 13:07:02,371 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 584 transitions. Word has length 90 [2024-11-12 13:07:02,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:07:02,372 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 584 transitions. [2024-11-12 13:07:02,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-12 13:07:02,372 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 584 transitions. [2024-11-12 13:07:02,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-12 13:07:02,373 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:07:02,373 INFO L218 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] [2024-11-12 13:07:02,380 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 (8)] Forceful destruction successful, exit code 0 [2024-11-12 13:07:02,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:07:02,574 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:07:02,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:07:02,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1494873881, now seen corresponding path program 1 times [2024-11-12 13:07:02,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:07:02,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518428701] [2024-11-12 13:07:02,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:07:02,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:07:02,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:07:02,577 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:07:02,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-12 13:07:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:07:02,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 13:07:02,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:07:03,039 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 13:07:03,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:07:03,200 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 13:07:03,200 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:07:03,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518428701] [2024-11-12 13:07:03,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518428701] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:07:03,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:07:03,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-12 13:07:03,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046505224] [2024-11-12 13:07:03,201 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:07:03,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 13:07:03,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:07:03,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 13:07:03,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-12 13:07:03,203 INFO L87 Difference]: Start difference. First operand 448 states and 584 transitions. Second operand has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 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-12 13:07:03,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:07:03,618 INFO L93 Difference]: Finished difference Result 463 states and 607 transitions. [2024-11-12 13:07:03,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 13:07:03,619 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 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 100 [2024-11-12 13:07:03,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:07:03,622 INFO L225 Difference]: With dead ends: 463 [2024-11-12 13:07:03,622 INFO L226 Difference]: Without dead ends: 459 [2024-11-12 13:07:03,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-12 13:07:03,623 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 7 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 13:07:03,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2111 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 13:07:03,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-12 13:07:03,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 457. [2024-11-12 13:07:03,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 430 states have (on average 1.2883720930232558) internal successors, (554), 448 states have internal predecessors, (554), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-11-12 13:07:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 596 transitions. [2024-11-12 13:07:03,637 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 596 transitions. Word has length 100 [2024-11-12 13:07:03,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:07:03,637 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 596 transitions. [2024-11-12 13:07:03,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.571428571428571) internal successors, (106), 14 states have internal predecessors, (106), 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-12 13:07:03,638 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 596 transitions. [2024-11-12 13:07:03,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-12 13:07:03,639 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:07:03,639 INFO L218 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] [2024-11-12 13:07:03,654 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-12 13:07:03,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:07:03,840 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:07:03,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:07:03,841 INFO L85 PathProgramCache]: Analyzing trace with hash 322445190, now seen corresponding path program 2 times [2024-11-12 13:07:03,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:07:03,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1718456776] [2024-11-12 13:07:03,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:07:03,842 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:07:03,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:07:03,843 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:07:03,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-12 13:07:04,134 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 13:07:04,135 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:07:04,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 13:07:04,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:07:04,160 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:07:04,161 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:07:04,161 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 13:07:04,164 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-12 13:07:04,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 13:07:04,227 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-12 13:07:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2024-11-12 13:07:04,248 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:07:04,248 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:07:04,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1718456776] [2024-11-12 13:07:04,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1718456776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:07:04,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:07:04,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:07:04,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272541479] [2024-11-12 13:07:04,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:07:04,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:07:04,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:07:04,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:07:04,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:07:04,250 INFO L87 Difference]: Start difference. First operand 457 states and 596 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-12 13:07:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:07:04,661 INFO L93 Difference]: Finished difference Result 668 states and 891 transitions. [2024-11-12 13:07:04,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 13:07:04,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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 109 [2024-11-12 13:07:04,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:07:04,665 INFO L225 Difference]: With dead ends: 668 [2024-11-12 13:07:04,665 INFO L226 Difference]: Without dead ends: 668 [2024-11-12 13:07:04,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 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-12 13:07:04,665 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 187 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:07:04,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 743 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 13:07:04,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2024-11-12 13:07:04,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 461. [2024-11-12 13:07:04,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 434 states have (on average 1.2857142857142858) internal successors, (558), 452 states have internal predecessors, (558), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-11-12 13:07:04,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 600 transitions. [2024-11-12 13:07:04,685 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 600 transitions. Word has length 109 [2024-11-12 13:07:04,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:07:04,686 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 600 transitions. [2024-11-12 13:07:04,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-12 13:07:04,687 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 600 transitions. [2024-11-12 13:07:04,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-12 13:07:04,688 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:07:04,688 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:07:04,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-12 13:07:04,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:07:04,892 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:07:04,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:07:04,893 INFO L85 PathProgramCache]: Analyzing trace with hash -227175846, now seen corresponding path program 1 times [2024-11-12 13:07:04,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:07:04,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348018165] [2024-11-12 13:07:04,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:07:04,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:07:04,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:07:04,895 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:07:04,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-12 13:07:05,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:07:05,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 726 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 13:07:05,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:07:05,566 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-12 13:07:05,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:07:06,078 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-12 13:07:06,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:07:06,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348018165] [2024-11-12 13:07:06,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348018165] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:07:06,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:07:06,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-12 13:07:06,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379941551] [2024-11-12 13:07:06,079 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:07:06,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-12 13:07:06,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:07:06,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-12 13:07:06,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-12 13:07:06,081 INFO L87 Difference]: Start difference. First operand 461 states and 600 transitions. Second operand has 26 states, 26 states have (on average 5.769230769230769) internal successors, (150), 26 states have internal predecessors, (150), 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-12 13:07:07,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:07:07,716 INFO L93 Difference]: Finished difference Result 485 states and 641 transitions. [2024-11-12 13:07:07,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-12 13:07:07,717 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.769230769230769) internal successors, (150), 26 states have internal predecessors, (150), 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 142 [2024-11-12 13:07:07,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:07:07,718 INFO L225 Difference]: With dead ends: 485 [2024-11-12 13:07:07,719 INFO L226 Difference]: Without dead ends: 481 [2024-11-12 13:07:07,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-12 13:07:07,720 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 13 mSDsluCounter, 4212 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4478 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-12 13:07:07,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4478 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-12 13:07:07,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-11-12 13:07:07,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 479. [2024-11-12 13:07:07,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 452 states have (on average 1.2876106194690264) internal successors, (582), 470 states have internal predecessors, (582), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-11-12 13:07:07,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 624 transitions. [2024-11-12 13:07:07,739 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 624 transitions. Word has length 142 [2024-11-12 13:07:07,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:07:07,740 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 624 transitions. [2024-11-12 13:07:07,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.769230769230769) internal successors, (150), 26 states have internal predecessors, (150), 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-12 13:07:07,741 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 624 transitions. [2024-11-12 13:07:07,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 13:07:07,743 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:07:07,744 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:07:07,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-12 13:07:07,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:07:07,945 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:07:07,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:07:07,945 INFO L85 PathProgramCache]: Analyzing trace with hash -2082640198, now seen corresponding path program 2 times [2024-11-12 13:07:07,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:07:07,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [235827655] [2024-11-12 13:07:07,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:07:07,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:07:07,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:07:07,949 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:07:07,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-12 13:07:08,265 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 13:07:08,265 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:07:08,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 13:07:08,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:07:08,307 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-12 13:07:08,307 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:07:08,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:07:08,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [235827655] [2024-11-12 13:07:08,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [235827655] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:07:08,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:07:08,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 13:07:08,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995610814] [2024-11-12 13:07:08,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:07:08,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 13:07:08,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:07:08,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 13:07:08,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 13:07:08,308 INFO L87 Difference]: Start difference. First operand 479 states and 624 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-12 13:07:08,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:07:08,417 INFO L93 Difference]: Finished difference Result 539 states and 684 transitions. [2024-11-12 13:07:08,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 13:07:08,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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 160 [2024-11-12 13:07:08,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:07:08,423 INFO L225 Difference]: With dead ends: 539 [2024-11-12 13:07:08,423 INFO L226 Difference]: Without dead ends: 539 [2024-11-12 13:07:08,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 158 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-12 13:07:08,424 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 5 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:07:08,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 483 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:07:08,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2024-11-12 13:07:08,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2024-11-12 13:07:08,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 512 states have (on average 1.25390625) internal successors, (642), 530 states have internal predecessors, (642), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-11-12 13:07:08,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 684 transitions. [2024-11-12 13:07:08,435 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 684 transitions. Word has length 160 [2024-11-12 13:07:08,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:07:08,435 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 684 transitions. [2024-11-12 13:07:08,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-12 13:07:08,435 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 684 transitions. [2024-11-12 13:07:08,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-12 13:07:08,437 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:07:08,438 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:07:08,446 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-12 13:07:08,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:07:08,638 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:07:08,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:07:08,639 INFO L85 PathProgramCache]: Analyzing trace with hash -919267394, now seen corresponding path program 1 times [2024-11-12 13:07:08,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:07:08,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427457712] [2024-11-12 13:07:08,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:07:08,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:07:08,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:07:08,641 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:07:08,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-12 13:07:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:07:09,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 13:07:09,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:07:09,759 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-12 13:07:09,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:07:11,264 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-12 13:07:11,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:07:11,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427457712] [2024-11-12 13:07:11,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427457712] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:07:11,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:07:11,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-12 13:07:11,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082272002] [2024-11-12 13:07:11,265 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:07:11,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-12 13:07:11,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:07:11,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-12 13:07:11,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-12 13:07:11,267 INFO L87 Difference]: Start difference. First operand 539 states and 684 transitions. Second operand has 50 states, 50 states have (on average 3.48) internal successors, (174), 50 states have internal predecessors, (174), 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-12 13:07:17,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:07:17,521 INFO L93 Difference]: Finished difference Result 579 states and 757 transitions. [2024-11-12 13:07:17,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-12 13:07:17,522 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.48) internal successors, (174), 50 states have internal predecessors, (174), 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 160 [2024-11-12 13:07:17,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:07:17,524 INFO L225 Difference]: With dead ends: 579 [2024-11-12 13:07:17,524 INFO L226 Difference]: Without dead ends: 575 [2024-11-12 13:07:17,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-12 13:07:17,527 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 25 mSDsluCounter, 6597 mSDsCounter, 0 mSdLazyCounter, 1917 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6863 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-12 13:07:17,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6863 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1917 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-12 13:07:17,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-11-12 13:07:17,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 573. [2024-11-12 13:07:17,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 546 states have (on average 1.26007326007326) internal successors, (688), 564 states have internal predecessors, (688), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-11-12 13:07:17,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 730 transitions. [2024-11-12 13:07:17,537 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 730 transitions. Word has length 160 [2024-11-12 13:07:17,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:07:17,537 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 730 transitions. [2024-11-12 13:07:17,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.48) internal successors, (174), 50 states have internal predecessors, (174), 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-12 13:07:17,537 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 730 transitions. [2024-11-12 13:07:17,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-12 13:07:17,538 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:07:17,538 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:07:17,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-12 13:07:17,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:07:17,739 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:07:17,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:07:17,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1310572450, now seen corresponding path program 2 times [2024-11-12 13:07:17,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:07:17,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418416] [2024-11-12 13:07:17,742 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:07:17,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:07:17,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:07:17,743 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:07:17,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-12 13:07:18,152 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 13:07:18,152 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:07:18,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 13:07:18,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:07:18,186 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2351 trivial. 0 not checked. [2024-11-12 13:07:18,187 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 13:07:18,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:07:18,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418416] [2024-11-12 13:07:18,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 13:07:18,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 13:07:18,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 13:07:18,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854592275] [2024-11-12 13:07:18,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 13:07:18,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 13:07:18,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:07:18,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 13:07:18,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 13:07:18,189 INFO L87 Difference]: Start difference. First operand 573 states and 730 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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-12 13:07:18,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:07:18,270 INFO L93 Difference]: Finished difference Result 522 states and 646 transitions. [2024-11-12 13:07:18,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 13:07:18,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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 194 [2024-11-12 13:07:18,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:07:18,272 INFO L225 Difference]: With dead ends: 522 [2024-11-12 13:07:18,272 INFO L226 Difference]: Without dead ends: 522 [2024-11-12 13:07:18,273 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 191 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-12 13:07:18,273 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 32 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 13:07:18,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 694 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 13:07:18,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2024-11-12 13:07:18,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 522. [2024-11-12 13:07:18,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 495 states have (on average 1.2202020202020203) internal successors, (604), 513 states have internal predecessors, (604), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-11-12 13:07:18,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 646 transitions. [2024-11-12 13:07:18,281 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 646 transitions. Word has length 194 [2024-11-12 13:07:18,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:07:18,281 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 646 transitions. [2024-11-12 13:07:18,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 4 states have internal predecessors, (119), 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-12 13:07:18,282 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 646 transitions. [2024-11-12 13:07:18,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-12 13:07:18,283 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:07:18,283 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 13:07:18,289 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-12 13:07:18,483 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-12 13:07:18,484 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:07:18,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:07:18,484 INFO L85 PathProgramCache]: Analyzing trace with hash 713363728, now seen corresponding path program 1 times [2024-11-12 13:07:18,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:07:18,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2122949160] [2024-11-12 13:07:18,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 13:07:18,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:07:18,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:07:18,487 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-12 13:07:18,487 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-12 13:07:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 13:07:19,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 1288 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 13:07:19,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:07:20,150 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-12 13:07:20,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:07:22,266 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-12 13:07:22,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:07:22,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2122949160] [2024-11-12 13:07:22,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2122949160] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:07:22,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:07:22,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-12 13:07:22,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763864041] [2024-11-12 13:07:22,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:07:22,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-12 13:07:22,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:07:22,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-12 13:07:22,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-12 13:07:22,269 INFO L87 Difference]: Start difference. First operand 522 states and 646 transitions. Second operand has 52 states, 52 states have (on average 3.3076923076923075) internal successors, (172), 52 states have internal predecessors, (172), 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-12 13:07:29,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 13:07:29,413 INFO L93 Difference]: Finished difference Result 551 states and 702 transitions. [2024-11-12 13:07:29,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-12 13:07:29,414 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.3076923076923075) internal successors, (172), 52 states have internal predecessors, (172), 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 194 [2024-11-12 13:07:29,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 13:07:29,416 INFO L225 Difference]: With dead ends: 551 [2024-11-12 13:07:29,416 INFO L226 Difference]: Without dead ends: 551 [2024-11-12 13:07:29,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-12 13:07:29,418 INFO L435 NwaCegarLoop]: 254 mSDtfsCounter, 27 mSDsluCounter, 6553 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 6807 SdHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-12 13:07:29,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 6807 Invalid, 1435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-12 13:07:29,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2024-11-12 13:07:29,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 547. [2024-11-12 13:07:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 520 states have (on average 1.2576923076923077) internal successors, (654), 538 states have internal predecessors, (654), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 7 states have call predecessors, (21), 19 states have call successors, (21) [2024-11-12 13:07:29,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 696 transitions. [2024-11-12 13:07:29,430 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 696 transitions. Word has length 194 [2024-11-12 13:07:29,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 13:07:29,430 INFO L471 AbstractCegarLoop]: Abstraction has 547 states and 696 transitions. [2024-11-12 13:07:29,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.3076923076923075) internal successors, (172), 52 states have internal predecessors, (172), 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-12 13:07:29,431 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 696 transitions. [2024-11-12 13:07:29,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-11-12 13:07:29,432 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 13:07:29,432 INFO L218 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-12 13:07:29,453 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-12 13:07:29,633 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-12 13:07:29,633 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 13:07:29,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 13:07:29,634 INFO L85 PathProgramCache]: Analyzing trace with hash 2107222831, now seen corresponding path program 2 times [2024-11-12 13:07:29,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 13:07:29,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1516831424] [2024-11-12 13:07:29,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 13:07:29,635 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 13:07:29,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 13:07:29,637 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 13:07:29,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-12 13:07:31,570 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 13:07:31,570 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 13:07:31,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 1563 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-12 13:07:31,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 13:07:33,431 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-12 13:07:33,432 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 13:07:40,960 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-12 13:07:40,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 13:07:40,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1516831424] [2024-11-12 13:07:40,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1516831424] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 13:07:40,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 13:07:40,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-12 13:07:40,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125245106] [2024-11-12 13:07:40,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 13:07:40,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-12 13:07:40,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 13:07:40,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-12 13:07:40,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-12 13:07:40,965 INFO L87 Difference]: Start difference. First operand 547 states and 696 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)