./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.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 2dcad53e9f7fd6e0b6384d19db4719ec6aa2601fd94c6ce0d3c746f1ec6b3601 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:57:36,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:57:36,364 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-16 23:57:36,369 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:57:36,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:57:36,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:57:36,398 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:57:36,398 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:57:36,398 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 23:57:36,400 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 23:57:36,400 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:57:36,400 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:57:36,401 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:57:36,404 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:57:36,404 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:57:36,404 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:57:36,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:57:36,405 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:57:36,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:57:36,405 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:57:36,405 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:57:36,406 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:57:36,406 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-16 23:57:36,406 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-16 23:57:36,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:57:36,407 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:57:36,407 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 23:57:36,407 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:57:36,407 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:57:36,407 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:57:36,408 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:57:36,408 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:57:36,408 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:57:36,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:57:36,409 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 23:57:36,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:57:36,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:57:36,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:57:36,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:57:36,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:57:36,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:57:36,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:57:36,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:57:36,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:57:36,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:57:36,412 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 -> 2dcad53e9f7fd6e0b6384d19db4719ec6aa2601fd94c6ce0d3c746f1ec6b3601 [2024-11-16 23:57:36,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:57:36,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:57:36,613 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:57:36,614 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:57:36,614 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:57:36,617 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2024-11-16 23:57:37,993 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:57:38,214 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:57:38,215 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2024-11-16 23:57:38,229 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5d6e4417/191761dacd424b5d9de830a26a6a74ef/FLAG8c5f911e4 [2024-11-16 23:57:38,558 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5d6e4417/191761dacd424b5d9de830a26a6a74ef [2024-11-16 23:57:38,561 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:57:38,562 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:57:38,567 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:57:38,567 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:57:38,572 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:57:38,572 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:57:38" (1/1) ... [2024-11-16 23:57:38,573 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ad0c57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:38, skipping insertion in model container [2024-11-16 23:57:38,573 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:57:38" (1/1) ... [2024-11-16 23:57:38,619 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:57:38,947 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:39,003 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:39,013 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:39,017 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:39,024 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:39,061 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:39,063 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:39,066 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:39,073 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:39,082 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:39,087 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:39,091 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:39,092 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:39,092 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:39,093 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:39,096 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:39,097 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:39,097 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:39,098 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:39,100 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:39,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:57:39,125 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-16 23:57:39,130 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5defd1d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:39, skipping insertion in model container [2024-11-16 23:57:39,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:57:39,130 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-16 23:57:39,135 INFO L158 Benchmark]: Toolchain (without parser) took 569.07ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 92.5MB in the beginning and 211.8MB in the end (delta: -119.3MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-11-16 23:57:39,136 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 167.8MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 23:57:39,136 INFO L158 Benchmark]: CACSL2BoogieTranslator took 563.37ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 92.4MB in the beginning and 211.8MB in the end (delta: -119.4MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-11-16 23:57:39,137 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.19ms. Allocated memory is still 167.8MB. Free memory is still 118.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 563.37ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 92.4MB in the beginning and 211.8MB in the end (delta: -119.4MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 769]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.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 2dcad53e9f7fd6e0b6384d19db4719ec6aa2601fd94c6ce0d3c746f1ec6b3601 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:57:41,145 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:57:41,213 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-16 23:57:41,218 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:57:41,219 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:57:41,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:57:41,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:57:41,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:57:41,245 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 23:57:41,245 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 23:57:41,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:57:41,245 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:57:41,246 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:57:41,246 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:57:41,247 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:57:41,247 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:57:41,247 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:57:41,247 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:57:41,248 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:57:41,248 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:57:41,248 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:57:41,251 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:57:41,251 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-16 23:57:41,252 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-16 23:57:41,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:57:41,258 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:57:41,258 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 23:57:41,258 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 23:57:41,258 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:57:41,258 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 23:57:41,259 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:57:41,259 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:57:41,259 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:57:41,259 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:57:41,259 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:57:41,260 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:57:41,260 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 23:57:41,260 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:57:41,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:57:41,260 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:57:41,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:57:41,261 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 23:57:41,261 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 23:57:41,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:57:41,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:57:41,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:57:41,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:57:41,262 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 -> 2dcad53e9f7fd6e0b6384d19db4719ec6aa2601fd94c6ce0d3c746f1ec6b3601 [2024-11-16 23:57:41,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:57:41,540 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:57:41,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:57:41,545 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:57:41,545 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:57:41,546 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2024-11-16 23:57:42,858 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:57:43,145 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:57:43,146 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test4-3.i [2024-11-16 23:57:43,163 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40d16ced4/baa4faee83464a44969c12fcccc4dbbc/FLAGef31ae1b2 [2024-11-16 23:57:43,450 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40d16ced4/baa4faee83464a44969c12fcccc4dbbc [2024-11-16 23:57:43,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:57:43,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:57:43,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:57:43,457 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:57:43,461 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:57:43,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:57:43" (1/1) ... [2024-11-16 23:57:43,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12ac4434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:43, skipping insertion in model container [2024-11-16 23:57:43,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:57:43" (1/1) ... [2024-11-16 23:57:43,513 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:57:43,927 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:43,965 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:43,972 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:43,978 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:43,984 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,025 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,026 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,028 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,032 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,039 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,039 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,041 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,042 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,043 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,043 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,046 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,047 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,047 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,048 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,050 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,055 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:57:44,064 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-16 23:57:44,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:57:44,088 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,110 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,116 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,117 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,124 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,168 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,169 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,173 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,175 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,183 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,186 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,187 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,188 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,194 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,194 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,198 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,199 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,199 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,200 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,202 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-16 23:57:44,207 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:57:44,212 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:57:44,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:57:44,346 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:57:44,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:44 WrapperNode [2024-11-16 23:57:44,348 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:57:44,349 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:57:44,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:57:44,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:57:44,356 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:44" (1/1) ... [2024-11-16 23:57:44,387 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:44" (1/1) ... [2024-11-16 23:57:44,455 INFO L138 Inliner]: procedures = 179, calls = 435, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1428 [2024-11-16 23:57:44,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:57:44,457 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:57:44,458 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:57:44,458 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:57:44,466 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:44" (1/1) ... [2024-11-16 23:57:44,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:44" (1/1) ... [2024-11-16 23:57:44,481 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:44" (1/1) ... [2024-11-16 23:57:44,603 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2024-11-16 23:57:44,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:44" (1/1) ... [2024-11-16 23:57:44,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:44" (1/1) ... [2024-11-16 23:57:44,648 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:44" (1/1) ... [2024-11-16 23:57:44,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:44" (1/1) ... [2024-11-16 23:57:44,660 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:44" (1/1) ... [2024-11-16 23:57:44,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:44" (1/1) ... [2024-11-16 23:57:44,679 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:57:44,680 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:57:44,681 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:57:44,681 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:57:44,682 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:44" (1/1) ... [2024-11-16 23:57:44,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:57:44,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:57:44,709 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-16 23:57:44,715 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-16 23:57:44,769 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-16 23:57:44,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-16 23:57:44,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-16 23:57:44,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-16 23:57:44,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-16 23:57:44,770 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-16 23:57:44,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-16 23:57:44,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-16 23:57:44,770 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-16 23:57:44,770 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-16 23:57:44,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 23:57:44,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:57:44,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 23:57:44,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 23:57:44,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 23:57:44,771 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 23:57:44,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 23:57:44,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-16 23:57:44,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-16 23:57:44,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 23:57:44,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 23:57:44,771 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:57:44,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:57:45,025 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:57:45,027 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:57:55,227 INFO L? ?]: Removed 209 outVars from TransFormulas that were not future-live. [2024-11-16 23:57:55,228 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:57:55,241 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:57:55,243 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:57:55,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:57:55 BoogieIcfgContainer [2024-11-16 23:57:55,244 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:57:55,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:57:55,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:57:55,248 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:57:55,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:57:43" (1/3) ... [2024-11-16 23:57:55,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4dc3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:57:55, skipping insertion in model container [2024-11-16 23:57:55,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:57:44" (2/3) ... [2024-11-16 23:57:55,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d4dc3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:57:55, skipping insertion in model container [2024-11-16 23:57:55,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:57:55" (3/3) ... [2024-11-16 23:57:55,252 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test4-3.i [2024-11-16 23:57:55,265 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:57:55,265 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-16 23:57:55,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:57:55,318 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;@11afa08c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:57:55,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-16 23:57:55,325 INFO L276 IsEmpty]: Start isEmpty. Operand has 279 states, 258 states have (on average 1.6434108527131783) internal successors, (424), 270 states have internal predecessors, (424), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 23:57:55,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-16 23:57:55,333 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:57:55,333 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:57:55,334 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:57:55,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:57:55,339 INFO L85 PathProgramCache]: Analyzing trace with hash -852190877, now seen corresponding path program 1 times [2024-11-16 23:57:55,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:57:55,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [554562172] [2024-11-16 23:57:55,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:57:55,349 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-16 23:57:55,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:57:55,355 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-16 23:57:55,358 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-16 23:57:55,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:57:55,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 23:57:55,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:57:55,557 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-16 23:57:55,561 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:57:55,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:57:55,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [554562172] [2024-11-16 23:57:55,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [554562172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:57:55,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:57:55,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:57:55,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308358242] [2024-11-16 23:57:55,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:57:55,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 23:57:55,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:57:55,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 23:57:55,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 23:57:55,588 INFO L87 Difference]: Start difference. First operand has 279 states, 258 states have (on average 1.6434108527131783) internal successors, (424), 270 states have internal predecessors, (424), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-16 23:57:55,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:57:55,613 INFO L93 Difference]: Finished difference Result 278 states and 369 transitions. [2024-11-16 23:57:55,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 23:57:55,615 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 12 [2024-11-16 23:57:55,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:57:55,638 INFO L225 Difference]: With dead ends: 278 [2024-11-16 23:57:55,642 INFO L226 Difference]: Without dead ends: 275 [2024-11-16 23:57:55,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 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-16 23:57:55,651 INFO L432 NwaCegarLoop]: 369 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, 369 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-16 23:57:55,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 23:57:55,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-11-16 23:57:55,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2024-11-16 23:57:55,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 255 states have (on average 1.3098039215686275) internal successors, (334), 266 states have internal predecessors, (334), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 23:57:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 366 transitions. [2024-11-16 23:57:55,731 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 366 transitions. Word has length 12 [2024-11-16 23:57:55,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:57:55,731 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 366 transitions. [2024-11-16 23:57:55,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-16 23:57:55,732 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 366 transitions. [2024-11-16 23:57:55,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-16 23:57:55,733 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:57:55,733 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:57:55,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 23:57:55,933 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-16 23:57:55,934 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:57:55,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:57:55,934 INFO L85 PathProgramCache]: Analyzing trace with hash -207962364, now seen corresponding path program 1 times [2024-11-16 23:57:55,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:57:55,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67315221] [2024-11-16 23:57:55,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:57:55,935 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-16 23:57:55,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:57:55,953 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-16 23:57:55,955 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-16 23:57:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:57:56,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 23:57:56,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:57:56,090 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-16 23:57:56,090 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:57:56,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:57:56,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67315221] [2024-11-16 23:57:56,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67315221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:57:56,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:57:56,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:57:56,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841145822] [2024-11-16 23:57:56,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:57:56,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:57:56,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:57:56,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:57:56,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:57:56,093 INFO L87 Difference]: Start difference. First operand 275 states and 366 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:57:56,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:57:56,268 INFO L93 Difference]: Finished difference Result 454 states and 597 transitions. [2024-11-16 23:57:56,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:57:56,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-16 23:57:56,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:57:56,276 INFO L225 Difference]: With dead ends: 454 [2024-11-16 23:57:56,276 INFO L226 Difference]: Without dead ends: 454 [2024-11-16 23:57:56,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:57:56,277 INFO L432 NwaCegarLoop]: 395 mSDtfsCounter, 217 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 23:57:56,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 756 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 23:57:56,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2024-11-16 23:57:56,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 277. [2024-11-16 23:57:56,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 257 states have (on average 1.3073929961089494) internal successors, (336), 268 states have internal predecessors, (336), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 23:57:56,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 368 transitions. [2024-11-16 23:57:56,292 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 368 transitions. Word has length 13 [2024-11-16 23:57:56,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:57:56,293 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 368 transitions. [2024-11-16 23:57:56,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:57:56,293 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 368 transitions. [2024-11-16 23:57:56,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 23:57:56,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:57:56,296 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:57:56,300 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-16 23:57:56,499 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-16 23:57:56,499 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:57:56,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:57:56,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1552285130, now seen corresponding path program 1 times [2024-11-16 23:57:56,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:57:56,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993769648] [2024-11-16 23:57:56,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:57:56,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 23:57:56,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:57:56,505 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 23:57:56,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 23:57:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:57:56,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 23:57:56,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:57:57,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:57:57,008 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:57:57,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:57:57,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993769648] [2024-11-16 23:57:57,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1993769648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:57:57,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:57:57,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:57:57,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834848727] [2024-11-16 23:57:57,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:57:57,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:57:57,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:57:57,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:57:57,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:57:57,014 INFO L87 Difference]: Start difference. First operand 277 states and 368 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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-16 23:57:57,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:57:57,118 INFO L93 Difference]: Finished difference Result 280 states and 363 transitions. [2024-11-16 23:57:57,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 23:57:57,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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 122 [2024-11-16 23:57:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:57:57,120 INFO L225 Difference]: With dead ends: 280 [2024-11-16 23:57:57,120 INFO L226 Difference]: Without dead ends: 280 [2024-11-16 23:57:57,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 119 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-16 23:57:57,121 INFO L432 NwaCegarLoop]: 336 mSDtfsCounter, 30 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 988 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-16 23:57:57,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 988 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 23:57:57,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-16 23:57:57,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2024-11-16 23:57:57,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 260 states have (on average 1.273076923076923) internal successors, (331), 271 states have internal predecessors, (331), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 23:57:57,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 363 transitions. [2024-11-16 23:57:57,150 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 363 transitions. Word has length 122 [2024-11-16 23:57:57,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:57:57,150 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 363 transitions. [2024-11-16 23:57:57,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 4 states have internal predecessors, (121), 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-16 23:57:57,150 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 363 transitions. [2024-11-16 23:57:57,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-16 23:57:57,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:57:57,154 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:57:57,171 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-16 23:57:57,355 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-16 23:57:57,355 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:57:57,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:57:57,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2079292036, now seen corresponding path program 1 times [2024-11-16 23:57:57,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:57:57,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744716648] [2024-11-16 23:57:57,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:57:57,358 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-16 23:57:57,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:57:57,360 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-16 23:57:57,361 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-16 23:57:57,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:57:57,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 23:57:57,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:57:58,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:57:58,140 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:57:58,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:57:58,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744716648] [2024-11-16 23:57:58,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744716648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:57:58,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:57:58,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 23:57:58,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371063919] [2024-11-16 23:57:58,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:57:58,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:57:58,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:57:58,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:57:58,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:57:58,142 INFO L87 Difference]: Start difference. First operand 280 states and 363 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-16 23:57:58,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:57:58,603 INFO L93 Difference]: Finished difference Result 378 states and 482 transitions. [2024-11-16 23:57:58,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:57:58,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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 122 [2024-11-16 23:57:58,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:57:58,610 INFO L225 Difference]: With dead ends: 378 [2024-11-16 23:57:58,610 INFO L226 Difference]: Without dead ends: 378 [2024-11-16 23:57:58,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 120 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-16 23:57:58,611 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 74 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 23:57:58,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 714 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 23:57:58,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2024-11-16 23:57:58,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 323. [2024-11-16 23:57:58,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 303 states have (on average 1.2475247524752475) internal successors, (378), 314 states have internal predecessors, (378), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 23:57:58,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 410 transitions. [2024-11-16 23:57:58,622 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 410 transitions. Word has length 122 [2024-11-16 23:57:58,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:57:58,622 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 410 transitions. [2024-11-16 23:57:58,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 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-16 23:57:58,623 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 410 transitions. [2024-11-16 23:57:58,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-16 23:57:58,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:57:58,625 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:57:58,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-16 23:57:58,825 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-16 23:57:58,826 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:57:58,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:57:58,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2002317802, now seen corresponding path program 1 times [2024-11-16 23:57:58,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:57:58,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970231180] [2024-11-16 23:57:58,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:57:58,827 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-16 23:57:58,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:57:58,831 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-16 23:57:58,835 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-16 23:57:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:57:59,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 23:57:59,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:57:59,308 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-16 23:57:59,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:57:59,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:57:59,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970231180] [2024-11-16 23:57:59,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970231180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:57:59,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:57:59,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:57:59,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969068592] [2024-11-16 23:57:59,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:57:59,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:57:59,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:57:59,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:57:59,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:57:59,311 INFO L87 Difference]: Start difference. First operand 323 states and 410 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 23:57:59,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:57:59,394 INFO L93 Difference]: Finished difference Result 326 states and 415 transitions. [2024-11-16 23:57:59,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:57:59,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 137 [2024-11-16 23:57:59,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:57:59,396 INFO L225 Difference]: With dead ends: 326 [2024-11-16 23:57:59,397 INFO L226 Difference]: Without dead ends: 326 [2024-11-16 23:57:59,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 134 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-16 23:57:59,398 INFO L432 NwaCegarLoop]: 351 mSDtfsCounter, 0 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 23:57:59,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1046 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 23:57:59,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-16 23:57:59,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2024-11-16 23:57:59,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 305 states have (on average 1.2491803278688525) internal successors, (381), 317 states have internal predecessors, (381), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-16 23:57:59,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 415 transitions. [2024-11-16 23:57:59,406 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 415 transitions. Word has length 137 [2024-11-16 23:57:59,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:57:59,406 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 415 transitions. [2024-11-16 23:57:59,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-16 23:57:59,406 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 415 transitions. [2024-11-16 23:57:59,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-16 23:57:59,408 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:57:59,408 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:57:59,420 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 (6)] Forceful destruction successful, exit code 0 [2024-11-16 23:57:59,612 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-16 23:57:59,613 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:57:59,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:57:59,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1278594286, now seen corresponding path program 1 times [2024-11-16 23:57:59,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:57:59,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [878621366] [2024-11-16 23:57:59,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:57:59,615 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-16 23:57:59,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:57:59,616 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-16 23:57:59,617 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-16 23:58:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:58:00,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 688 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 23:58:00,111 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:58:00,137 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-16 23:58:00,138 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:58:00,213 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-16 23:58:00,213 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:58:00,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [878621366] [2024-11-16 23:58:00,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [878621366] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:58:00,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 23:58:00,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-16 23:58:00,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819326354] [2024-11-16 23:58:00,214 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 23:58:00,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 23:58:00,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:58:00,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 23:58:00,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 23:58:00,215 INFO L87 Difference]: Start difference. First operand 326 states and 415 transitions. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 23:58:00,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:58:00,350 INFO L93 Difference]: Finished difference Result 337 states and 432 transitions. [2024-11-16 23:58:00,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 23:58:00,351 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 139 [2024-11-16 23:58:00,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:58:00,352 INFO L225 Difference]: With dead ends: 337 [2024-11-16 23:58:00,353 INFO L226 Difference]: Without dead ends: 337 [2024-11-16 23:58:00,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 270 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-16 23:58:00,355 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 4 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 23:58:00,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1047 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 23:58:00,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-16 23:58:00,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2024-11-16 23:58:00,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 313 states have (on average 1.2619808306709266) internal successors, (395), 325 states have internal predecessors, (395), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (18), 7 states have call predecessors, (18), 16 states have call successors, (18) [2024-11-16 23:58:00,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 429 transitions. [2024-11-16 23:58:00,369 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 429 transitions. Word has length 139 [2024-11-16 23:58:00,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:58:00,370 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 429 transitions. [2024-11-16 23:58:00,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-16 23:58:00,374 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 429 transitions. [2024-11-16 23:58:00,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-16 23:58:00,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:58:00,376 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:58:00,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-16 23:58:00,576 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-16 23:58:00,577 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:58:00,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:58:00,577 INFO L85 PathProgramCache]: Analyzing trace with hash 333028970, now seen corresponding path program 2 times [2024-11-16 23:58:00,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:58:00,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1182511424] [2024-11-16 23:58:00,578 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 23:58:00,578 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-16 23:58:00,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:58:00,581 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-16 23:58:00,582 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-16 23:58:01,001 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-16 23:58:01,002 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 23:58:01,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 23:58:01,010 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:58:01,570 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-16 23:58:01,570 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:58:01,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:58:01,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1182511424] [2024-11-16 23:58:01,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1182511424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:58:01,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:58:01,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:58:01,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077927796] [2024-11-16 23:58:01,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:58:01,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:58:01,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:58:01,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:58:01,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:58:01,572 INFO L87 Difference]: Start difference. First operand 335 states and 429 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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-16 23:58:05,675 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-16 23:58:10,334 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-16 23:58:16,168 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-16 23:58:16,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:58:16,169 INFO L93 Difference]: Finished difference Result 420 states and 540 transitions. [2024-11-16 23:58:16,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:58:16,179 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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 143 [2024-11-16 23:58:16,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:58:16,181 INFO L225 Difference]: With dead ends: 420 [2024-11-16 23:58:16,181 INFO L226 Difference]: Without dead ends: 420 [2024-11-16 23:58:16,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 140 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-16 23:58:16,182 INFO L432 NwaCegarLoop]: 354 mSDtfsCounter, 51 mSDsluCounter, 636 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2024-11-16 23:58:16,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 990 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 14.6s Time] [2024-11-16 23:58:16,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-16 23:58:16,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-11-16 23:58:16,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 395 states have (on average 1.2632911392405064) internal successors, (499), 407 states have internal predecessors, (499), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2024-11-16 23:58:16,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 540 transitions. [2024-11-16 23:58:16,221 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 540 transitions. Word has length 143 [2024-11-16 23:58:16,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:58:16,222 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 540 transitions. [2024-11-16 23:58:16,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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-16 23:58:16,222 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 540 transitions. [2024-11-16 23:58:16,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-16 23:58:16,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:58:16,223 INFO L215 NwaCegarLoop]: trace histogram [12, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:58:16,235 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-16 23:58:16,424 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-16 23:58:16,424 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:58:16,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:58:16,425 INFO L85 PathProgramCache]: Analyzing trace with hash -434740902, now seen corresponding path program 1 times [2024-11-16 23:58:16,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:58:16,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904047621] [2024-11-16 23:58:16,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:58:16,426 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-16 23:58:16,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:58:16,429 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-16 23:58:16,430 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-16 23:58:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:58:17,070 INFO L255 TraceCheckSpWp]: Trace formula consists of 927 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 23:58:17,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:58:17,139 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 66 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-16 23:58:17,140 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:58:17,444 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 2 proven. 71 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-16 23:58:17,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:58:17,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904047621] [2024-11-16 23:58:17,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904047621] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:58:17,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 23:58:17,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-16 23:58:17,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834304681] [2024-11-16 23:58:17,446 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 23:58:17,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 23:58:17,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:58:17,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 23:58:17,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-16 23:58:17,448 INFO L87 Difference]: Start difference. First operand 420 states and 540 transitions. Second operand has 14 states, 14 states have (on average 10.928571428571429) internal successors, (153), 14 states have internal predecessors, (153), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 23:58:17,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:58:17,926 INFO L93 Difference]: Finished difference Result 435 states and 564 transitions. [2024-11-16 23:58:17,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-16 23:58:17,927 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 10.928571428571429) internal successors, (153), 14 states have internal predecessors, (153), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 164 [2024-11-16 23:58:17,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:58:17,929 INFO L225 Difference]: With dead ends: 435 [2024-11-16 23:58:17,929 INFO L226 Difference]: Without dead ends: 431 [2024-11-16 23:58:17,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-16 23:58:17,930 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 7 mSDsluCounter, 3109 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3459 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 23:58:17,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3459 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 23:58:17,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2024-11-16 23:58:17,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 429. [2024-11-16 23:58:17,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 404 states have (on average 1.2648514851485149) internal successors, (511), 416 states have internal predecessors, (511), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2024-11-16 23:58:17,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 552 transitions. [2024-11-16 23:58:17,937 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 552 transitions. Word has length 164 [2024-11-16 23:58:17,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:58:17,938 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 552 transitions. [2024-11-16 23:58:17,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 10.928571428571429) internal successors, (153), 14 states have internal predecessors, (153), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 23:58:17,938 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 552 transitions. [2024-11-16 23:58:17,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-16 23:58:17,939 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:58:17,939 INFO L215 NwaCegarLoop]: trace histogram [30, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:58:17,954 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-16 23:58:18,143 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-16 23:58:18,144 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:58:18,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:58:18,145 INFO L85 PathProgramCache]: Analyzing trace with hash 768408480, now seen corresponding path program 2 times [2024-11-16 23:58:18,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:58:18,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51730308] [2024-11-16 23:58:18,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 23:58:18,146 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-16 23:58:18,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:58:18,147 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-16 23:58:18,149 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-16 23:58:18,859 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 23:58:18,859 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 23:58:18,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 23:58:18,896 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:58:19,043 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 264 proven. 55 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2024-11-16 23:58:19,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:58:19,500 INFO L134 CoverageAnalysis]: Checked inductivity of 581 backedges. 2 proven. 314 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-16 23:58:19,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:58:19,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51730308] [2024-11-16 23:58:19,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51730308] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:58:19,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 23:58:19,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-16 23:58:19,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614782518] [2024-11-16 23:58:19,501 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 23:58:19,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-16 23:58:19,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:58:19,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-16 23:58:19,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-16 23:58:19,503 INFO L87 Difference]: Start difference. First operand 429 states and 552 transitions. Second operand has 26 states, 26 states have (on average 6.346153846153846) internal successors, (165), 26 states have internal predecessors, (165), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 23:58:21,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:58:21,193 INFO L93 Difference]: Finished difference Result 453 states and 594 transitions. [2024-11-16 23:58:21,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-16 23:58:21,194 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 6.346153846153846) internal successors, (165), 26 states have internal predecessors, (165), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 182 [2024-11-16 23:58:21,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:58:21,195 INFO L225 Difference]: With dead ends: 453 [2024-11-16 23:58:21,195 INFO L226 Difference]: Without dead ends: 449 [2024-11-16 23:58:21,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 338 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-16 23:58:21,196 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 14 mSDsluCounter, 3820 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4170 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 23:58:21,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4170 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 23:58:21,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2024-11-16 23:58:21,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 447. [2024-11-16 23:58:21,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 422 states have (on average 1.2677725118483412) internal successors, (535), 434 states have internal predecessors, (535), 19 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (22), 10 states have call predecessors, (22), 19 states have call successors, (22) [2024-11-16 23:58:21,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 576 transitions. [2024-11-16 23:58:21,205 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 576 transitions. Word has length 182 [2024-11-16 23:58:21,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:58:21,205 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 576 transitions. [2024-11-16 23:58:21,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.346153846153846) internal successors, (165), 26 states have internal predecessors, (165), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 23:58:21,205 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 576 transitions. [2024-11-16 23:58:21,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-16 23:58:21,207 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:58:21,207 INFO L215 NwaCegarLoop]: trace histogram [66, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:58:21,225 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-16 23:58:21,407 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-16 23:58:21,408 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:58:21,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:58:21,408 INFO L85 PathProgramCache]: Analyzing trace with hash -616470048, now seen corresponding path program 3 times [2024-11-16 23:58:21,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:58:21,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975305105] [2024-11-16 23:58:21,409 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 23:58:21,409 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-16 23:58:21,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:58:21,412 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-16 23:58:21,416 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-16 23:58:21,925 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-16 23:58:21,925 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 23:58:21,935 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 23:58:21,938 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:58:22,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2435 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2433 trivial. 0 not checked. [2024-11-16 23:58:22,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:58:22,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2435 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2433 trivial. 0 not checked. [2024-11-16 23:58:22,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:58:22,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975305105] [2024-11-16 23:58:22,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975305105] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:58:22,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 23:58:22,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-16 23:58:22,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218271839] [2024-11-16 23:58:22,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 23:58:22,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:58:22,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:58:22,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:58:22,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:58:22,446 INFO L87 Difference]: Start difference. First operand 447 states and 576 transitions. Second operand has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 23:58:22,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:58:22,845 INFO L93 Difference]: Finished difference Result 861 states and 1096 transitions. [2024-11-16 23:58:22,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:58:22,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 218 [2024-11-16 23:58:22,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:58:22,848 INFO L225 Difference]: With dead ends: 861 [2024-11-16 23:58:22,848 INFO L226 Difference]: Without dead ends: 861 [2024-11-16 23:58:22,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 430 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-16 23:58:22,849 INFO L432 NwaCegarLoop]: 563 mSDtfsCounter, 868 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 882 SdHoareTripleChecker+Valid, 1624 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 23:58:22,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [882 Valid, 1624 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 23:58:22,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-11-16 23:58:22,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2024-11-16 23:58:22,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 821 states have (on average 1.2423873325213155) internal successors, (1020), 833 states have internal predecessors, (1020), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (42), 25 states have call predecessors, (42), 34 states have call successors, (42) [2024-11-16 23:58:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1096 transitions. [2024-11-16 23:58:22,867 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1096 transitions. Word has length 218 [2024-11-16 23:58:22,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:58:22,868 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1096 transitions. [2024-11-16 23:58:22,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 42.833333333333336) internal successors, (257), 6 states have internal predecessors, (257), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 23:58:22,869 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1096 transitions. [2024-11-16 23:58:22,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2024-11-16 23:58:22,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:58:22,881 INFO L215 NwaCegarLoop]: trace histogram [66, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:58:22,906 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-16 23:58:23,084 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-16 23:58:23,085 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:58:23,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:58:23,086 INFO L85 PathProgramCache]: Analyzing trace with hash -73150424, now seen corresponding path program 1 times [2024-11-16 23:58:23,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:58:23,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923822743] [2024-11-16 23:58:23,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:58:23,088 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-16 23:58:23,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:58:23,093 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-16 23:58:23,102 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-16 23:58:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:58:24,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 3009 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-16 23:58:24,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:58:25,739 INFO L134 CoverageAnalysis]: Checked inductivity of 3083 backedges. 1209 proven. 253 refuted. 0 times theorem prover too weak. 1621 trivial. 0 not checked. [2024-11-16 23:58:25,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:58:27,468 INFO L134 CoverageAnalysis]: Checked inductivity of 3083 backedges. 119 proven. 1340 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-11-16 23:58:27,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:58:27,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923822743] [2024-11-16 23:58:27,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923822743] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:58:27,469 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 23:58:27,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-16 23:58:27,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9555866] [2024-11-16 23:58:27,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 23:58:27,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-16 23:58:27,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:58:27,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-16 23:58:27,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-16 23:58:27,471 INFO L87 Difference]: Start difference. First operand 861 states and 1096 transitions. Second operand has 50 states, 50 states have (on average 4.64) internal successors, (232), 50 states have internal predecessors, (232), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 23:58:33,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:58:33,352 INFO L93 Difference]: Finished difference Result 901 states and 1175 transitions. [2024-11-16 23:58:33,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-16 23:58:33,355 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.64) internal successors, (232), 50 states have internal predecessors, (232), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 545 [2024-11-16 23:58:33,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:58:33,357 INFO L225 Difference]: With dead ends: 901 [2024-11-16 23:58:33,357 INFO L226 Difference]: Without dead ends: 897 [2024-11-16 23:58:33,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1131 GetRequests, 1040 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-16 23:58:33,361 INFO L432 NwaCegarLoop]: 350 mSDtfsCounter, 26 mSDsluCounter, 8327 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 8677 SdHoareTripleChecker+Invalid, 2081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-16 23:58:33,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 8677 Invalid, 2081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-16 23:58:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2024-11-16 23:58:33,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 895. [2024-11-16 23:58:33,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 855 states have (on average 1.246783625730994) internal successors, (1066), 867 states have internal predecessors, (1066), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (42), 25 states have call predecessors, (42), 34 states have call successors, (42) [2024-11-16 23:58:33,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1142 transitions. [2024-11-16 23:58:33,378 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1142 transitions. Word has length 545 [2024-11-16 23:58:33,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:58:33,378 INFO L471 AbstractCegarLoop]: Abstraction has 895 states and 1142 transitions. [2024-11-16 23:58:33,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.64) internal successors, (232), 50 states have internal predecessors, (232), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-16 23:58:33,379 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1142 transitions. [2024-11-16 23:58:33,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2024-11-16 23:58:33,386 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:58:33,386 INFO L215 NwaCegarLoop]: trace histogram [134, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:58:33,429 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 (12)] Forceful destruction successful, exit code 0 [2024-11-16 23:58:33,587 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-16 23:58:33,588 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:58:33,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:58:33,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1381868264, now seen corresponding path program 2 times [2024-11-16 23:58:33,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:58:33,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545755337] [2024-11-16 23:58:33,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 23:58:33,590 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-16 23:58:33,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:58:33,592 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-16 23:58:33,596 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-16 23:58:36,601 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 23:58:36,601 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 23:58:36,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 3757 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-16 23:58:36,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:58:37,257 INFO L134 CoverageAnalysis]: Checked inductivity of 10121 backedges. 5974 proven. 276 refuted. 0 times theorem prover too weak. 3871 trivial. 0 not checked. [2024-11-16 23:58:37,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:58:39,340 INFO L134 CoverageAnalysis]: Checked inductivity of 10121 backedges. 1201 proven. 1936 refuted. 0 times theorem prover too weak. 6984 trivial. 0 not checked. [2024-11-16 23:58:39,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:58:39,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [545755337] [2024-11-16 23:58:39,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [545755337] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:58:39,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 23:58:39,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-16 23:58:39,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459157176] [2024-11-16 23:58:39,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 23:58:39,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-16 23:58:39,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:58:39,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-16 23:58:39,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-16 23:58:39,344 INFO L87 Difference]: Start difference. First operand 895 states and 1142 transitions. Second operand has 52 states, 52 states have (on average 4.5) internal successors, (234), 52 states have internal predecessors, (234), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 23:58:46,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:58:46,085 INFO L93 Difference]: Finished difference Result 924 states and 1210 transitions. [2024-11-16 23:58:46,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-16 23:58:46,086 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 4.5) internal successors, (234), 52 states have internal predecessors, (234), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 613 [2024-11-16 23:58:46,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:58:46,089 INFO L225 Difference]: With dead ends: 924 [2024-11-16 23:58:46,089 INFO L226 Difference]: Without dead ends: 924 [2024-11-16 23:58:46,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1271 GetRequests, 1174 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-16 23:58:46,092 INFO L432 NwaCegarLoop]: 349 mSDtfsCounter, 27 mSDsluCounter, 8628 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 8977 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-16 23:58:46,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 8977 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-16 23:58:46,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2024-11-16 23:58:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 920. [2024-11-16 23:58:46,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 880 states have (on average 1.268181818181818) internal successors, (1116), 892 states have internal predecessors, (1116), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (42), 25 states have call predecessors, (42), 34 states have call successors, (42) [2024-11-16 23:58:46,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1192 transitions. [2024-11-16 23:58:46,107 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1192 transitions. Word has length 613 [2024-11-16 23:58:46,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:58:46,107 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1192 transitions. [2024-11-16 23:58:46,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 4.5) internal successors, (234), 52 states have internal predecessors, (234), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-16 23:58:46,107 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1192 transitions. [2024-11-16 23:58:46,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2024-11-16 23:58:46,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:58:46,112 INFO L215 NwaCegarLoop]: trace histogram [184, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:58:46,174 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 (13)] Forceful destruction successful, exit code 0 [2024-11-16 23:58:46,315 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-16 23:58:46,316 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:58:46,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:58:46,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1033416238, now seen corresponding path program 3 times [2024-11-16 23:58:46,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:58:46,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415742040] [2024-11-16 23:58:46,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 23:58:46,319 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-16 23:58:46,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:58:46,320 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-16 23:58:46,321 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-16 23:58:47,439 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-16 23:58:47,439 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 23:58:47,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 537 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 23:58:47,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:58:47,543 INFO L134 CoverageAnalysis]: Checked inductivity of 18246 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 18090 trivial. 0 not checked. [2024-11-16 23:58:47,544 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 23:58:47,544 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:58:47,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415742040] [2024-11-16 23:58:47,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415742040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:58:47,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:58:47,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:58:47,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569277970] [2024-11-16 23:58:47,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:58:47,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:58:47,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:58:47,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:58:47,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:58:47,545 INFO L87 Difference]: Start difference. First operand 920 states and 1192 transitions. Second operand has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-16 23:58:47,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 23:58:47,689 INFO L93 Difference]: Finished difference Result 932 states and 1172 transitions. [2024-11-16 23:58:47,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 23:58:47,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 663 [2024-11-16 23:58:47,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 23:58:47,692 INFO L225 Difference]: With dead ends: 932 [2024-11-16 23:58:47,693 INFO L226 Difference]: Without dead ends: 932 [2024-11-16 23:58:47,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 661 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-16 23:58:47,695 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 30 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 955 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-16 23:58:47,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 955 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 23:58:47,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2024-11-16 23:58:47,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2024-11-16 23:58:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 932 states, 892 states have (on average 1.2286995515695067) internal successors, (1096), 904 states have internal predecessors, (1096), 34 states have call successors, (34), 3 states have call predecessors, (34), 4 states have return successors, (42), 25 states have call predecessors, (42), 34 states have call successors, (42) [2024-11-16 23:58:47,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1172 transitions. [2024-11-16 23:58:47,710 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1172 transitions. Word has length 663 [2024-11-16 23:58:47,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 23:58:47,711 INFO L471 AbstractCegarLoop]: Abstraction has 932 states and 1172 transitions. [2024-11-16 23:58:47,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-16 23:58:47,711 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1172 transitions. [2024-11-16 23:58:47,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2024-11-16 23:58:47,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 23:58:47,716 INFO L215 NwaCegarLoop]: trace histogram [184, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:58:47,731 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 (14)] Forceful destruction successful, exit code 0 [2024-11-16 23:58:47,916 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-16 23:58:47,917 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-16 23:58:47,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:58:47,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1213926114, now seen corresponding path program 1 times [2024-11-16 23:58:47,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 23:58:47,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901271850] [2024-11-16 23:58:47,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:58:47,920 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-16 23:58:47,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 23:58:47,923 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-16 23:58:47,924 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-16 23:58:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:58:51,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 4259 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-16 23:58:51,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 23:58:53,674 INFO L134 CoverageAnalysis]: Checked inductivity of 18246 backedges. 11174 proven. 1176 refuted. 0 times theorem prover too weak. 5896 trivial. 0 not checked. [2024-11-16 23:58:53,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 23:59:00,369 INFO L134 CoverageAnalysis]: Checked inductivity of 18246 backedges. 2326 proven. 5786 refuted. 0 times theorem prover too weak. 10134 trivial. 0 not checked. [2024-11-16 23:59:00,369 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 23:59:00,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901271850] [2024-11-16 23:59:00,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [901271850] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 23:59:00,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 23:59:00,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-16 23:59:00,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911699428] [2024-11-16 23:59:00,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 23:59:00,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-16 23:59:00,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 23:59:00,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-16 23:59:00,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-16 23:59:00,376 INFO L87 Difference]: Start difference. First operand 932 states and 1172 transitions. Second operand has 102 states, 102 states have (on average 2.784313725490196) internal successors, (284), 102 states have internal predecessors, (284), 2 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7)