./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:50:47,287 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:50:47,364 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-12 12:50:47,370 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:50:47,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:50:47,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:50:47,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:50:47,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:50:47,402 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 12:50:47,405 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 12:50:47,406 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:50:47,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:50:47,407 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:50:47,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:50:47,407 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:50:47,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:50:47,408 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:50:47,408 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:50:47,408 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:50:47,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:50:47,408 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:50:47,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:50:47,412 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 12:50:47,412 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 12:50:47,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:50:47,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:50:47,412 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 12:50:47,413 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:50:47,413 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:50:47,413 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:50:47,413 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:50:47,414 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:50:47,414 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:50:47,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:50:47,414 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 12:50:47,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:50:47,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:50:47,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:50:47,415 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:50:47,415 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 12:50:47,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 12:50:47,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:50:47,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:50:47,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:50:47,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:50:47,419 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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2024-11-12 12:50:47,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:50:47,739 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:50:47,742 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:50:47,743 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:50:47,743 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:50:47,745 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_nondet_test3-1.i [2024-11-12 12:50:49,086 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:50:49,397 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:50:49,398 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-1.i [2024-11-12 12:50:49,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15e36afb5/ea8bcf35cde04e2382b71639b7ea0222/FLAGf2002e233 [2024-11-12 12:50:49,668 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15e36afb5/ea8bcf35cde04e2382b71639b7ea0222 [2024-11-12 12:50:49,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:50:49,671 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:50:49,672 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:50:49,673 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:50:49,678 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:50:49,679 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:50:49" (1/1) ... [2024-11-12 12:50:49,680 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a6080c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:49, skipping insertion in model container [2024-11-12 12:50:49,680 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:50:49" (1/1) ... [2024-11-12 12:50:49,739 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:50:50,182 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:50,226 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:50,231 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:50,238 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:50,249 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:50,295 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:50,296 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:50,298 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:50,299 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:50,301 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:50,304 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:50,307 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:50,308 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:50,314 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:50,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:50:50,338 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-12 12:50:50,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@18e338eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:50, skipping insertion in model container [2024-11-12 12:50:50,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:50:50,341 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-12 12:50:50,343 INFO L158 Benchmark]: Toolchain (without parser) took 670.35ms. Allocated memory is still 161.5MB. Free memory was 113.2MB in the beginning and 90.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-12 12:50:50,343 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 98.6MB. Free memory is still 66.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 12:50:50,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 668.16ms. Allocated memory is still 161.5MB. Free memory was 113.2MB in the beginning and 90.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-12 12:50:50,345 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 98.6MB. Free memory is still 66.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 668.16ms. Allocated memory is still 161.5MB. Free memory was 113.2MB in the beginning and 90.2MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 750]: 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_nondet_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 12:50:52,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 12:50:52,448 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-12 12:50:52,454 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 12:50:52,455 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 12:50:52,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 12:50:52,486 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 12:50:52,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 12:50:52,487 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 12:50:52,487 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 12:50:52,488 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 12:50:52,488 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 12:50:52,488 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 12:50:52,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 12:50:52,491 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 12:50:52,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 12:50:52,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 12:50:52,494 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 12:50:52,495 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 12:50:52,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 12:50:52,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 12:50:52,496 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 12:50:52,496 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-12 12:50:52,496 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-12 12:50:52,500 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 12:50:52,500 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 12:50:52,501 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 12:50:52,501 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 12:50:52,501 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 12:50:52,501 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 12:50:52,502 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 12:50:52,502 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 12:50:52,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 12:50:52,502 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 12:50:52,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 12:50:52,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 12:50:52,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 12:50:52,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 12:50:52,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:50:52,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 12:50:52,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 12:50:52,505 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 12:50:52,505 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 12:50:52,506 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 12:50:52,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 12:50:52,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 12:50:52,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 12:50:52,506 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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2024-11-12 12:50:52,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 12:50:52,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 12:50:52,829 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 12:50:52,831 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 12:50:52,832 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 12:50:52,833 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_nondet_test3-1.i [2024-11-12 12:50:54,408 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 12:50:54,751 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 12:50:54,752 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test3-1.i [2024-11-12 12:50:54,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78d2d0b96/c890c28a73244cddb5f412c4d891f580/FLAGe5cf2fff8 [2024-11-12 12:50:54,782 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78d2d0b96/c890c28a73244cddb5f412c4d891f580 [2024-11-12 12:50:54,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 12:50:54,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 12:50:54,787 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 12:50:54,787 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 12:50:54,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 12:50:54,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:50:54" (1/1) ... [2024-11-12 12:50:54,796 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eff68f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:54, skipping insertion in model container [2024-11-12 12:50:54,796 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 12:50:54" (1/1) ... [2024-11-12 12:50:54,863 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:50:55,323 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,367 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,375 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,379 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,391 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,426 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,427 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,429 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,430 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,435 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,438 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,440 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,441 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,446 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,460 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:50:55,478 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-12 12:50:55,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 12:50:55,543 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,560 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,565 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,571 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,578 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,606 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,606 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,608 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,609 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,611 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,612 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,612 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,613 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,616 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-12 12:50:55,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:50:55,627 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 12:50:55,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 12:50:55,778 INFO L204 MainTranslator]: Completed translation [2024-11-12 12:50:55,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:55 WrapperNode [2024-11-12 12:50:55,780 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 12:50:55,781 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 12:50:55,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 12:50:55,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 12:50:55,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:55" (1/1) ... [2024-11-12 12:50:55,838 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:55" (1/1) ... [2024-11-12 12:50:55,902 INFO L138 Inliner]: procedures = 180, calls = 274, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1031 [2024-11-12 12:50:55,906 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 12:50:55,907 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 12:50:55,907 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 12:50:55,907 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 12:50:55,918 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:55" (1/1) ... [2024-11-12 12:50:55,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:55" (1/1) ... [2024-11-12 12:50:55,928 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:55" (1/1) ... [2024-11-12 12:50:55,996 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 34, 218]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-11-12 12:50:55,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:55" (1/1) ... [2024-11-12 12:50:55,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:55" (1/1) ... [2024-11-12 12:50:56,039 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:55" (1/1) ... [2024-11-12 12:50:56,052 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:55" (1/1) ... [2024-11-12 12:50:56,057 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:55" (1/1) ... [2024-11-12 12:50:56,063 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:55" (1/1) ... [2024-11-12 12:50:56,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 12:50:56,073 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 12:50:56,074 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 12:50:56,074 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 12:50:56,075 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:55" (1/1) ... [2024-11-12 12:50:56,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 12:50:56,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 12:50:56,125 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 12:50:56,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 12:50:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-12 12:50:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-12 12:50:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-12 12:50:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-12 12:50:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-12 12:50:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-12 12:50:56,167 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-12 12:50:56,167 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-12 12:50:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-12 12:50:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-12 12:50:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-12 12:50:56,168 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-12 12:50:56,168 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-12 12:50:56,168 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-12 12:50:56,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 12:50:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 12:50:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 12:50:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 12:50:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 12:50:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 12:50:56,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 12:50:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 12:50:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 12:50:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-12 12:50:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-12 12:50:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-12 12:50:56,170 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 12:50:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 12:50:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-12 12:50:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-12 12:50:56,171 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 12:50:56,171 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 12:50:56,421 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 12:50:56,424 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 12:51:05,079 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2024-11-12 12:51:05,079 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 12:51:05,102 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 12:51:05,102 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-12 12:51:05,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:51:05 BoogieIcfgContainer [2024-11-12 12:51:05,103 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 12:51:05,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 12:51:05,115 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 12:51:05,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 12:51:05,118 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 12:50:54" (1/3) ... [2024-11-12 12:51:05,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663fda26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:51:05, skipping insertion in model container [2024-11-12 12:51:05,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 12:50:55" (2/3) ... [2024-11-12 12:51:05,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@663fda26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 12:51:05, skipping insertion in model container [2024-11-12 12:51:05,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 12:51:05" (3/3) ... [2024-11-12 12:51:05,122 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test3-1.i [2024-11-12 12:51:05,140 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 12:51:05,141 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-12 12:51:05,193 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 12:51:05,200 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;@7a76f358, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 12:51:05,200 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-12 12:51:05,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 202 states, 192 states have (on average 1.6614583333333333) internal successors, (319), 195 states have internal predecessors, (319), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 12:51:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-12 12:51:05,214 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:51:05,215 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-12 12:51:05,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:51:05,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:51:05,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1665195, now seen corresponding path program 1 times [2024-11-12 12:51:05,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:51:05,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904717732] [2024-11-12 12:51:05,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:51:05,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:05,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:51:05,235 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:51:05,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 12:51:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:51:05,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 12:51:05,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:51:05,517 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_16| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_16| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_16|)))) is different from true [2024-11-12 12:51:05,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:51:05,518 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:51:05,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:51:05,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904717732] [2024-11-12 12:51:05,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904717732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:51:05,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:51:05,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:51:05,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563136629] [2024-11-12 12:51:05,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:51:05,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 12:51:05,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:51:05,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 12:51:05,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-12 12:51:05,567 INFO L87 Difference]: Start difference. First operand has 202 states, 192 states have (on average 1.6614583333333333) internal successors, (319), 195 states have internal predecessors, (319), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:51:09,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 12:51:10,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:51:10,595 INFO L93 Difference]: Finished difference Result 297 states and 388 transitions. [2024-11-12 12:51:10,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 12:51:10,604 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-12 12:51:10,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:51:10,613 INFO L225 Difference]: With dead ends: 297 [2024-11-12 12:51:10,613 INFO L226 Difference]: Without dead ends: 294 [2024-11-12 12:51:10,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-12 12:51:10,617 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 121 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-12 12:51:10,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 488 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 1 Unknown, 389 Unchecked, 4.9s Time] [2024-11-12 12:51:10,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2024-11-12 12:51:10,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 199. [2024-11-12 12:51:10,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 190 states have (on average 1.2947368421052632) internal successors, (246), 192 states have internal predecessors, (246), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-12 12:51:10,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 256 transitions. [2024-11-12 12:51:10,666 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 256 transitions. Word has length 4 [2024-11-12 12:51:10,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:51:10,666 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 256 transitions. [2024-11-12 12:51:10,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:51:10,667 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 256 transitions. [2024-11-12 12:51:10,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-12 12:51:10,667 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:51:10,668 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:51:10,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-12 12:51:10,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:10,872 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:51:10,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:51:10,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1471248736, now seen corresponding path program 1 times [2024-11-12 12:51:10,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:51:10,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905399722] [2024-11-12 12:51:10,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:51:10,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:10,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:51:10,875 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:51:10,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 12:51:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:51:11,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 12:51:11,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:51:11,265 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_17| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_17| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_17|)))) is different from true [2024-11-12 12:51:11,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:51:11,266 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:51:11,266 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:51:11,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905399722] [2024-11-12 12:51:11,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905399722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:51:11,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:51:11,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-12 12:51:11,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642997329] [2024-11-12 12:51:11,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:51:11,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 12:51:11,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:51:11,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 12:51:11,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-12 12:51:11,272 INFO L87 Difference]: Start difference. First operand 199 states and 256 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:51:15,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 12:51:16,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:51:16,167 INFO L93 Difference]: Finished difference Result 295 states and 384 transitions. [2024-11-12 12:51:16,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 12:51:16,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-12 12:51:16,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:51:16,184 INFO L225 Difference]: With dead ends: 295 [2024-11-12 12:51:16,184 INFO L226 Difference]: Without dead ends: 293 [2024-11-12 12:51:16,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-12 12:51:16,185 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 113 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 383 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-12 12:51:16,186 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 485 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 1 Unknown, 383 Unchecked, 4.9s Time] [2024-11-12 12:51:16,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2024-11-12 12:51:16,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 269. [2024-11-12 12:51:16,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 258 states have (on average 1.302325581395349) internal successors, (336), 260 states have internal predecessors, (336), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 12:51:16,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 350 transitions. [2024-11-12 12:51:16,201 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 350 transitions. Word has length 12 [2024-11-12 12:51:16,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:51:16,201 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 350 transitions. [2024-11-12 12:51:16,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:51:16,201 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 350 transitions. [2024-11-12 12:51:16,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-12 12:51:16,202 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:51:16,202 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:51:16,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-12 12:51:16,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:16,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:51:16,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:51:16,406 INFO L85 PathProgramCache]: Analyzing trace with hash -84302715, now seen corresponding path program 1 times [2024-11-12 12:51:16,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:51:16,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127651244] [2024-11-12 12:51:16,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:51:16,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:16,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:51:16,408 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:51:16,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 12:51:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:51:16,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 12:51:16,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:51:16,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:51:16,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:51:16,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:51:16,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127651244] [2024-11-12 12:51:16,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127651244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:51:16,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:51:16,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 12:51:16,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231783934] [2024-11-12 12:51:16,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:51:16,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 12:51:16,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:51:16,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 12:51:16,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 12:51:16,670 INFO L87 Difference]: Start difference. First operand 269 states and 350 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:51:20,928 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 12:51:22,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 12:51:24,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 12:51:24,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:51:24,154 INFO L93 Difference]: Finished difference Result 358 states and 465 transitions. [2024-11-12 12:51:24,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 12:51:24,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 15 [2024-11-12 12:51:24,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:51:24,158 INFO L225 Difference]: With dead ends: 358 [2024-11-12 12:51:24,158 INFO L226 Difference]: Without dead ends: 356 [2024-11-12 12:51:24,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 12:51:24,159 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 136 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 687 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-11-12 12:51:24,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 687 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 1 Unknown, 0 Unchecked, 7.5s Time] [2024-11-12 12:51:24,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-12 12:51:24,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 355. [2024-11-12 12:51:24,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 344 states have (on average 1.302325581395349) internal successors, (448), 347 states have internal predecessors, (448), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 12:51:24,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 462 transitions. [2024-11-12 12:51:24,179 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 462 transitions. Word has length 15 [2024-11-12 12:51:24,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:51:24,179 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 462 transitions. [2024-11-12 12:51:24,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:51:24,180 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 462 transitions. [2024-11-12 12:51:24,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 12:51:24,181 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:51:24,182 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:51:24,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-12 12:51:24,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:24,386 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:51:24,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:51:24,386 INFO L85 PathProgramCache]: Analyzing trace with hash -100457035, now seen corresponding path program 1 times [2024-11-12 12:51:24,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:51:24,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070743056] [2024-11-12 12:51:24,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:51:24,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:24,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:51:24,389 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:51:24,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-12 12:51:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:51:24,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 12:51:24,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:51:24,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:51:24,646 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:51:24,646 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:51:24,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1070743056] [2024-11-12 12:51:24,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1070743056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:51:24,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:51:24,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 12:51:24,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584123807] [2024-11-12 12:51:24,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:51:24,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 12:51:24,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:51:24,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 12:51:24,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 12:51:24,649 INFO L87 Difference]: Start difference. First operand 355 states and 462 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:51:24,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:51:24,834 INFO L93 Difference]: Finished difference Result 364 states and 447 transitions. [2024-11-12 12:51:24,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 12:51:24,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 51 [2024-11-12 12:51:24,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:51:24,836 INFO L225 Difference]: With dead ends: 364 [2024-11-12 12:51:24,837 INFO L226 Difference]: Without dead ends: 364 [2024-11-12 12:51:24,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:51:24,838 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 30 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 659 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.2s IncrementalHoareTripleChecker+Time [2024-11-12 12:51:24,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 659 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 12:51:24,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-12 12:51:24,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2024-11-12 12:51:24,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 353 states have (on average 1.226628895184136) internal successors, (433), 356 states have internal predecessors, (433), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-12 12:51:24,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 447 transitions. [2024-11-12 12:51:24,858 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 447 transitions. Word has length 51 [2024-11-12 12:51:24,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:51:24,859 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 447 transitions. [2024-11-12 12:51:24,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:51:24,859 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 447 transitions. [2024-11-12 12:51:24,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 12:51:24,860 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:51:24,860 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:51:24,872 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-12 12:51:25,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:25,062 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:51:25,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:51:25,062 INFO L85 PathProgramCache]: Analyzing trace with hash 314719657, now seen corresponding path program 1 times [2024-11-12 12:51:25,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:51:25,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300174990] [2024-11-12 12:51:25,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:51:25,063 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:25,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:51:25,065 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:51:25,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-12 12:51:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:51:25,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 12:51:25,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:51:25,337 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:51:25,338 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:51:25,339 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:51:25,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-12 12:51:25,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:51:25,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-12 12:51:25,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:51:25,553 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:51:25,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:51:25,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300174990] [2024-11-12 12:51:25,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300174990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:51:25,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:51:25,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:51:25,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031808644] [2024-11-12 12:51:25,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:51:25,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 12:51:25,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:51:25,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 12:51:25,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:51:25,555 INFO L87 Difference]: Start difference. First operand 364 states and 447 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:51:26,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:51:26,236 INFO L93 Difference]: Finished difference Result 365 states and 454 transitions. [2024-11-12 12:51:26,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 12:51:26,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 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 51 [2024-11-12 12:51:26,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:51:26,239 INFO L225 Difference]: With dead ends: 365 [2024-11-12 12:51:26,239 INFO L226 Difference]: Without dead ends: 362 [2024-11-12 12:51:26,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-12 12:51:26,240 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 108 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 12:51:26,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 926 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 12:51:26,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2024-11-12 12:51:26,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 315. [2024-11-12 12:51:26,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 305 states have (on average 1.2426229508196722) internal successors, (379), 308 states have internal predecessors, (379), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 12:51:26,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 391 transitions. [2024-11-12 12:51:26,251 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 391 transitions. Word has length 51 [2024-11-12 12:51:26,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:51:26,252 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 391 transitions. [2024-11-12 12:51:26,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 12:51:26,252 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 391 transitions. [2024-11-12 12:51:26,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-12 12:51:26,254 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:51:26,254 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:51:26,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-12 12:51:26,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:26,456 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:51:26,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:51:26,456 INFO L85 PathProgramCache]: Analyzing trace with hash 622762343, now seen corresponding path program 1 times [2024-11-12 12:51:26,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:51:26,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348197285] [2024-11-12 12:51:26,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:51:26,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:26,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:51:26,461 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:51:26,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-12 12:51:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:51:26,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 12:51:26,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:51:26,964 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 12:51:26,965 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:51:26,965 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:51:26,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348197285] [2024-11-12 12:51:26,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348197285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:51:26,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:51:26,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 12:51:26,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668498755] [2024-11-12 12:51:26,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:51:26,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 12:51:26,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:51:26,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 12:51:26,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 12:51:26,967 INFO L87 Difference]: Start difference. First operand 315 states and 391 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 12:51:27,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:51:27,084 INFO L93 Difference]: Finished difference Result 321 states and 381 transitions. [2024-11-12 12:51:27,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 12:51:27,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2024-11-12 12:51:27,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:51:27,086 INFO L225 Difference]: With dead ends: 321 [2024-11-12 12:51:27,086 INFO L226 Difference]: Without dead ends: 321 [2024-11-12 12:51:27,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:51:27,087 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 33 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 12:51:27,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 623 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 12:51:27,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-12 12:51:27,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2024-11-12 12:51:27,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 311 states have (on average 1.1864951768488745) internal successors, (369), 314 states have internal predecessors, (369), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 12:51:27,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 381 transitions. [2024-11-12 12:51:27,096 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 381 transitions. Word has length 83 [2024-11-12 12:51:27,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:51:27,096 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 381 transitions. [2024-11-12 12:51:27,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 12:51:27,097 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 381 transitions. [2024-11-12 12:51:27,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-12 12:51:27,099 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:51:27,099 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:51:27,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-12 12:51:27,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:27,300 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:51:27,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:51:27,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1568237815, now seen corresponding path program 1 times [2024-11-12 12:51:27,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:51:27,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681222726] [2024-11-12 12:51:27,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:51:27,303 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:27,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:51:27,305 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:51:27,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-12 12:51:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:51:27,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 12:51:27,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:51:27,859 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 12:51:27,859 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:51:27,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:51:27,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681222726] [2024-11-12 12:51:27,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [681222726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:51:27,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:51:27,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-12 12:51:27,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758228339] [2024-11-12 12:51:27,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:51:27,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 12:51:27,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:51:27,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 12:51:27,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:51:27,861 INFO L87 Difference]: Start difference. First operand 321 states and 381 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 12:51:27,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:51:27,949 INFO L93 Difference]: Finished difference Result 309 states and 361 transitions. [2024-11-12 12:51:27,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 12:51:27,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 83 [2024-11-12 12:51:27,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:51:27,951 INFO L225 Difference]: With dead ends: 309 [2024-11-12 12:51:27,951 INFO L226 Difference]: Without dead ends: 309 [2024-11-12 12:51:27,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:51:27,952 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 8 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 12:51:27,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 623 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 12:51:27,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-12 12:51:27,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2024-11-12 12:51:27,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 299 states have (on average 1.1672240802675586) internal successors, (349), 302 states have internal predecessors, (349), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-12 12:51:27,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 361 transitions. [2024-11-12 12:51:27,961 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 361 transitions. Word has length 83 [2024-11-12 12:51:27,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:51:27,961 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 361 transitions. [2024-11-12 12:51:27,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 12:51:27,961 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 361 transitions. [2024-11-12 12:51:27,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-12 12:51:27,965 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:51:27,965 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:51:27,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-12 12:51:28,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:28,166 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:51:28,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:51:28,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1766137841, now seen corresponding path program 1 times [2024-11-12 12:51:28,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:51:28,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482859] [2024-11-12 12:51:28,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:51:28,168 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:28,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:51:28,169 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:51:28,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-12 12:51:28,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:51:28,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 12:51:28,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:51:28,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 12:51:28,664 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:51:28,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:51:28,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482859] [2024-11-12 12:51:28,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:51:28,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:51:28,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 12:51:28,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467460688] [2024-11-12 12:51:28,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:51:28,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 12:51:28,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:51:28,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 12:51:28,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 12:51:28,667 INFO L87 Difference]: Start difference. First operand 309 states and 361 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 12:51:28,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:51:28,710 INFO L93 Difference]: Finished difference Result 312 states and 365 transitions. [2024-11-12 12:51:28,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 12:51:28,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 83 [2024-11-12 12:51:28,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:51:28,714 INFO L225 Difference]: With dead ends: 312 [2024-11-12 12:51:28,714 INFO L226 Difference]: Without dead ends: 312 [2024-11-12 12:51:28,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 12:51:28,715 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 0 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 12:51:28,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 677 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 12:51:28,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2024-11-12 12:51:28,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2024-11-12 12:51:28,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 301 states have (on average 1.169435215946844) internal successors, (352), 305 states have internal predecessors, (352), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-12 12:51:28,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 365 transitions. [2024-11-12 12:51:28,735 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 365 transitions. Word has length 83 [2024-11-12 12:51:28,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:51:28,736 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 365 transitions. [2024-11-12 12:51:28,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 12:51:28,736 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 365 transitions. [2024-11-12 12:51:28,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-12 12:51:28,737 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:51:28,737 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:51:28,750 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 (9)] Forceful destruction successful, exit code 0 [2024-11-12 12:51:28,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:28,938 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:51:28,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:51:28,939 INFO L85 PathProgramCache]: Analyzing trace with hash -2046546993, now seen corresponding path program 1 times [2024-11-12 12:51:28,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:51:28,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [701347711] [2024-11-12 12:51:28,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:51:28,940 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:28,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:51:28,941 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:51:28,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-12 12:51:29,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:51:29,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 12:51:29,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:51:29,499 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-12 12:51:29,499 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:51:29,669 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-12 12:51:29,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:51:29,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [701347711] [2024-11-12 12:51:29,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [701347711] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:51:29,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 12:51:29,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-12 12:51:29,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207563039] [2024-11-12 12:51:29,670 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 12:51:29,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 12:51:29,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:51:29,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 12:51:29,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-12 12:51:29,672 INFO L87 Difference]: Start difference. First operand 312 states and 365 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 12:51:29,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:51:29,891 INFO L93 Difference]: Finished difference Result 323 states and 381 transitions. [2024-11-12 12:51:29,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 12:51:29,893 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 85 [2024-11-12 12:51:29,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:51:29,894 INFO L225 Difference]: With dead ends: 323 [2024-11-12 12:51:29,894 INFO L226 Difference]: Without dead ends: 323 [2024-11-12 12:51:29,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-12 12:51:29,895 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 5 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 12:51:29,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 902 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 12:51:29,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-12 12:51:29,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 321. [2024-11-12 12:51:29,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 309 states have (on average 1.1844660194174756) internal successors, (366), 313 states have internal predecessors, (366), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-12 12:51:29,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 379 transitions. [2024-11-12 12:51:29,913 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 379 transitions. Word has length 85 [2024-11-12 12:51:29,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:51:29,914 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 379 transitions. [2024-11-12 12:51:29,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 12:51:29,914 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 379 transitions. [2024-11-12 12:51:29,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-12 12:51:29,915 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:51:29,915 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:51:29,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-12 12:51:30,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:30,116 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:51:30,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:51:30,117 INFO L85 PathProgramCache]: Analyzing trace with hash -526540239, now seen corresponding path program 2 times [2024-11-12 12:51:30,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:51:30,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016890461] [2024-11-12 12:51:30,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 12:51:30,117 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:30,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:51:30,119 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:51:30,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-12 12:51:30,653 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 12:51:30,653 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 12:51:30,672 INFO L256 TraceCheckSpWp]: Trace formula consists of 547 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-12 12:51:30,675 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:51:30,770 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-12 12:51:30,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:51:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-12 12:51:31,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:51:31,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016890461] [2024-11-12 12:51:31,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2016890461] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:51:31,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 12:51:31,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-12 12:51:31,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214394024] [2024-11-12 12:51:31,108 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 12:51:31,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-12 12:51:31,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:51:31,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-12 12:51:31,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-12 12:51:31,110 INFO L87 Difference]: Start difference. First operand 321 states and 379 transitions. Second operand has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 12:51:31,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:51:31,766 INFO L93 Difference]: Finished difference Result 336 states and 401 transitions. [2024-11-12 12:51:31,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 12:51:31,768 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 89 [2024-11-12 12:51:31,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:51:31,769 INFO L225 Difference]: With dead ends: 336 [2024-11-12 12:51:31,769 INFO L226 Difference]: Without dead ends: 332 [2024-11-12 12:51:31,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-12 12:51:31,770 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 8 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-12 12:51:31,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1577 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-12 12:51:31,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-11-12 12:51:31,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2024-11-12 12:51:31,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 318 states have (on average 1.1886792452830188) internal successors, (378), 322 states have internal predecessors, (378), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-12 12:51:31,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 391 transitions. [2024-11-12 12:51:31,780 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 391 transitions. Word has length 89 [2024-11-12 12:51:31,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:51:31,780 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 391 transitions. [2024-11-12 12:51:31,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.785714285714286) internal successors, (95), 14 states have internal predecessors, (95), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 12:51:31,781 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 391 transitions. [2024-11-12 12:51:31,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-12 12:51:31,782 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:51:31,782 INFO L218 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:51:31,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-12 12:51:31,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:31,983 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:51:31,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:51:31,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1335059317, now seen corresponding path program 3 times [2024-11-12 12:51:31,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:51:31,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [29168497] [2024-11-12 12:51:31,985 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 12:51:31,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:31,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:51:31,988 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:51:31,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-12 12:51:32,492 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-12 12:51:32,492 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 12:51:32,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 12:51:32,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:51:32,710 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-12 12:51:32,710 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:51:32,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:51:32,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [29168497] [2024-11-12 12:51:32,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [29168497] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:51:32,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:51:32,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 12:51:32,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700823300] [2024-11-12 12:51:32,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:51:32,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 12:51:32,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:51:32,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 12:51:32,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 12:51:32,713 INFO L87 Difference]: Start difference. First operand 330 states and 391 transitions. Second operand has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 12:51:37,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 12:51:41,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 12:51:42,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:51:42,859 INFO L93 Difference]: Finished difference Result 423 states and 505 transitions. [2024-11-12 12:51:42,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 12:51:42,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 98 [2024-11-12 12:51:42,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:51:42,862 INFO L225 Difference]: With dead ends: 423 [2024-11-12 12:51:42,862 INFO L226 Difference]: Without dead ends: 423 [2024-11-12 12:51:42,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 12:51:42,863 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 423 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2024-11-12 12:51:42,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 391 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 81 Invalid, 2 Unknown, 0 Unchecked, 10.1s Time] [2024-11-12 12:51:42,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-12 12:51:42,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 419. [2024-11-12 12:51:42,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 406 states have (on average 1.1945812807881773) internal successors, (485), 411 states have internal predecessors, (485), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-12 12:51:42,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 500 transitions. [2024-11-12 12:51:42,879 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 500 transitions. Word has length 98 [2024-11-12 12:51:42,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:51:42,879 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 500 transitions. [2024-11-12 12:51:42,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 12:51:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 500 transitions. [2024-11-12 12:51:42,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-12 12:51:42,882 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:51:42,882 INFO L218 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:51:42,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-12 12:51:43,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:43,083 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:51:43,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:51:43,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1269092998, now seen corresponding path program 1 times [2024-11-12 12:51:43,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:51:43,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960693887] [2024-11-12 12:51:43,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:51:43,084 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:43,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:51:43,085 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:51:43,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-12 12:51:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:51:43,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 12:51:43,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:51:43,819 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 71 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 12:51:43,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:51:44,680 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 123 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-12 12:51:44,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:51:44,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960693887] [2024-11-12 12:51:44,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960693887] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:51:44,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 12:51:44,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-12 12:51:44,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854804038] [2024-11-12 12:51:44,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 12:51:44,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-12 12:51:44,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:51:44,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-12 12:51:44,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-12 12:51:44,685 INFO L87 Difference]: Start difference. First operand 419 states and 500 transitions. Second operand has 26 states, 26 states have (on average 4.1923076923076925) internal successors, (109), 26 states have internal predecessors, (109), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 12:51:46,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:51:46,993 INFO L93 Difference]: Finished difference Result 443 states and 540 transitions. [2024-11-12 12:51:46,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-12 12:51:46,994 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.1923076923076925) internal successors, (109), 26 states have internal predecessors, (109), 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 101 [2024-11-12 12:51:46,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:51:46,996 INFO L225 Difference]: With dead ends: 443 [2024-11-12 12:51:46,996 INFO L226 Difference]: Without dead ends: 439 [2024-11-12 12:51:46,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-12 12:51:46,997 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 14 mSDsluCounter, 2923 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 3150 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-12 12:51:46,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 3150 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-12 12:51:46,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-12 12:51:47,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 437. [2024-11-12 12:51:47,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 424 states have (on average 1.2004716981132075) internal successors, (509), 429 states have internal predecessors, (509), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-12 12:51:47,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 524 transitions. [2024-11-12 12:51:47,006 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 524 transitions. Word has length 101 [2024-11-12 12:51:47,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:51:47,007 INFO L471 AbstractCegarLoop]: Abstraction has 437 states and 524 transitions. [2024-11-12 12:51:47,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.1923076923076925) internal successors, (109), 26 states have internal predecessors, (109), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 12:51:47,007 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 524 transitions. [2024-11-12 12:51:47,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-12 12:51:47,008 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:51:47,009 INFO L218 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:51:47,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-12 12:51:47,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:47,210 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:51:47,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:51:47,210 INFO L85 PathProgramCache]: Analyzing trace with hash 275981370, now seen corresponding path program 2 times [2024-11-12 12:51:47,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:51:47,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597282309] [2024-11-12 12:51:47,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 12:51:47,211 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:47,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:51:47,212 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:51:47,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-12 12:51:47,824 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 12:51:47,825 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 12:51:47,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-12 12:51:47,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:51:48,436 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 281 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-12 12:51:48,436 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:51:50,182 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 2 proven. 531 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-12 12:51:50,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:51:50,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597282309] [2024-11-12 12:51:50,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [597282309] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:51:50,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 12:51:50,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-12 12:51:50,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604768954] [2024-11-12 12:51:50,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 12:51:50,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-12 12:51:50,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:51:50,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-12 12:51:50,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-12 12:51:50,186 INFO L87 Difference]: Start difference. First operand 437 states and 524 transitions. Second operand has 50 states, 50 states have (on average 2.66) internal successors, (133), 50 states have internal predecessors, (133), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 12:51:58,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:51:58,014 INFO L93 Difference]: Finished difference Result 477 states and 596 transitions. [2024-11-12 12:51:58,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-12 12:51:58,016 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.66) internal successors, (133), 50 states have internal predecessors, (133), 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 119 [2024-11-12 12:51:58,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:51:58,020 INFO L225 Difference]: With dead ends: 477 [2024-11-12 12:51:58,020 INFO L226 Difference]: Without dead ends: 473 [2024-11-12 12:51:58,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-12 12:51:58,023 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 25 mSDsluCounter, 6066 mSDsCounter, 0 mSdLazyCounter, 1947 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 6293 SdHoareTripleChecker+Invalid, 1978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-12 12:51:58,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 6293 Invalid, 1978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1947 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-12 12:51:58,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-12 12:51:58,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 471. [2024-11-12 12:51:58,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 458 states have (on average 1.2117903930131004) internal successors, (555), 463 states have internal predecessors, (555), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-12 12:51:58,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 570 transitions. [2024-11-12 12:51:58,034 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 570 transitions. Word has length 119 [2024-11-12 12:51:58,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:51:58,034 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 570 transitions. [2024-11-12 12:51:58,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.66) internal successors, (133), 50 states have internal predecessors, (133), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-12 12:51:58,034 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 570 transitions. [2024-11-12 12:51:58,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-11-12 12:51:58,036 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:51:58,036 INFO L218 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:51:58,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-12 12:51:58,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:58,237 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:51:58,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:51:58,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1009269306, now seen corresponding path program 3 times [2024-11-12 12:51:58,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:51:58,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130542691] [2024-11-12 12:51:58,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-12 12:51:58,240 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:58,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:51:58,243 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:51:58,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-12 12:51:58,787 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-12 12:51:58,788 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 12:51:58,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-12 12:51:58,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:51:59,256 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:51:59,257 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:51:59,258 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-12 12:51:59,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-12 12:51:59,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-12 12:51:59,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-12 12:51:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2349 trivial. 0 not checked. [2024-11-12 12:51:59,380 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 12:51:59,380 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:51:59,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130542691] [2024-11-12 12:51:59,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [130542691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 12:51:59,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 12:51:59,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 12:51:59,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93130468] [2024-11-12 12:51:59,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 12:51:59,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 12:51:59,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:51:59,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 12:51:59,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-12 12:51:59,382 INFO L87 Difference]: Start difference. First operand 471 states and 570 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 12:51:59,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:51:59,740 INFO L93 Difference]: Finished difference Result 581 states and 704 transitions. [2024-11-12 12:51:59,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 12:51:59,741 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 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 153 [2024-11-12 12:51:59,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:51:59,743 INFO L225 Difference]: With dead ends: 581 [2024-11-12 12:51:59,743 INFO L226 Difference]: Without dead ends: 581 [2024-11-12 12:51:59,744 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-12 12:51:59,744 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 237 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 12:51:59,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 690 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 12:51:59,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-11-12 12:51:59,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 473. [2024-11-12 12:51:59,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 460 states have (on average 1.2108695652173913) internal successors, (557), 465 states have internal predecessors, (557), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-12 12:51:59,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 572 transitions. [2024-11-12 12:51:59,754 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 572 transitions. Word has length 153 [2024-11-12 12:51:59,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:51:59,754 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 572 transitions. [2024-11-12 12:51:59,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 6 states have internal predecessors, (79), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 12:51:59,755 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 572 transitions. [2024-11-12 12:51:59,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-12 12:51:59,756 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:51:59,757 INFO L218 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:51:59,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-12 12:51:59,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:59,957 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:51:59,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:51:59,958 INFO L85 PathProgramCache]: Analyzing trace with hash -809847768, now seen corresponding path program 1 times [2024-11-12 12:51:59,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:51:59,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811094637] [2024-11-12 12:51:59,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 12:51:59,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:51:59,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:51:59,960 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:51:59,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-12 12:52:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 12:52:01,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 1290 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-12 12:52:01,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:52:01,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-12 12:52:01,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 12:52:04,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-12 12:52:04,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 12:52:04,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811094637] [2024-11-12 12:52:04,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [811094637] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 12:52:04,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-12 12:52:04,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-12 12:52:04,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048242321] [2024-11-12 12:52:04,293 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-12 12:52:04,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-12 12:52:04,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 12:52:04,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-12 12:52:04,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-12 12:52:04,295 INFO L87 Difference]: Start difference. First operand 473 states and 572 transitions. Second operand has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 52 states have internal predecessors, (175), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 12:52:11,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 12:52:11,838 INFO L93 Difference]: Finished difference Result 502 states and 626 transitions. [2024-11-12 12:52:11,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-12 12:52:11,840 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 52 states have internal predecessors, (175), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 197 [2024-11-12 12:52:11,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 12:52:11,841 INFO L225 Difference]: With dead ends: 502 [2024-11-12 12:52:11,842 INFO L226 Difference]: Without dead ends: 502 [2024-11-12 12:52:11,846 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-12 12:52:11,846 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 27 mSDsluCounter, 5602 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 5828 SdHoareTripleChecker+Invalid, 1444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-12 12:52:11,847 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 5828 Invalid, 1444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-12 12:52:11,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-12 12:52:11,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 498. [2024-11-12 12:52:11,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 485 states have (on average 1.2515463917525773) internal successors, (607), 490 states have internal predecessors, (607), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-12 12:52:11,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 622 transitions. [2024-11-12 12:52:11,856 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 622 transitions. Word has length 197 [2024-11-12 12:52:11,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 12:52:11,857 INFO L471 AbstractCegarLoop]: Abstraction has 498 states and 622 transitions. [2024-11-12 12:52:11,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 52 states have internal predecessors, (175), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-12 12:52:11,857 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 622 transitions. [2024-11-12 12:52:11,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-12 12:52:11,859 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 12:52:11,860 INFO L218 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 12:52:11,883 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 (16)] Ended with exit code 0 [2024-11-12 12:52:12,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:52:12,061 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-12 12:52:12,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 12:52:12,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1033564226, now seen corresponding path program 2 times [2024-11-12 12:52:12,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 12:52:12,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1303499259] [2024-11-12 12:52:12,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 12:52:12,062 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 12:52:12,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 12:52:12,063 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 12:52:12,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-12 12:52:13,847 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-12 12:52:13,847 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 12:52:13,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 1565 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-12 12:52:13,898 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 12:52:16,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 2209 proven. 1176 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-12 12:52:16,044 INFO L312 TraceCheckSpWp]: Computing backward predicates...