./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 023d838f 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_OAT_nondet_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:53:09,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:53:09,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-10 14:53:09,200 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:53:09,201 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:53:09,227 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:53:09,228 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:53:09,228 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:53:09,229 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 14:53:09,229 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 14:53:09,229 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:53:09,230 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:53:09,230 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:53:09,231 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:53:09,231 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:53:09,231 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:53:09,232 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:53:09,232 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:53:09,233 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:53:09,233 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:53:09,233 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:53:09,234 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:53:09,234 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 14:53:09,235 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 14:53:09,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:53:09,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:53:09,236 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 14:53:09,236 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:53:09,236 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:53:09,237 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:53:09,237 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:53:09,237 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:53:09,237 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:53:09,238 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:53:09,238 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 14:53:09,238 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:53:09,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:53:09,239 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:53:09,239 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:53:09,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:53:09,240 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:53:09,240 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:53:09,240 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:53:09,241 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:53:09,241 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:53:09,241 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2024-11-10 14:53:09,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:53:09,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:53:09,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:53:09,521 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:53:09,522 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:53:09,524 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i [2024-11-10 14:53:10,986 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:53:11,290 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:53:11,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i [2024-11-10 14:53:11,313 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4592ff6bc/f1cb9170451547a284eb5e6f70c38d13/FLAGe60762f86 [2024-11-10 14:53:11,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4592ff6bc/f1cb9170451547a284eb5e6f70c38d13 [2024-11-10 14:53:11,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:53:11,568 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:53:11,569 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:53:11,570 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:53:11,575 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:53:11,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:53:11" (1/1) ... [2024-11-10 14:53:11,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ec51fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:11, skipping insertion in model container [2024-11-10 14:53:11,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:53:11" (1/1) ... [2024-11-10 14:53:11,631 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:53:12,061 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:12,094 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:12,099 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:12,107 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:12,119 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:12,138 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:12,142 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:12,144 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:12,148 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:12,150 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:12,152 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:12,158 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:12,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:53:12,191 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-10 14:53:12,192 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@1ea99cb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:12, skipping insertion in model container [2024-11-10 14:53:12,192 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:53:12,193 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 14:53:12,195 INFO L158 Benchmark]: Toolchain (without parser) took 625.22ms. Allocated memory is still 153.1MB. Free memory was 95.3MB in the beginning and 73.8MB in the end (delta: 21.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-10 14:53:12,195 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 153.1MB. Free memory was 117.1MB in the beginning and 116.9MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:53:12,196 INFO L158 Benchmark]: CACSL2BoogieTranslator took 623.16ms. Allocated memory is still 153.1MB. Free memory was 95.3MB in the beginning and 73.8MB in the end (delta: 21.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-10 14:53:12,197 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.23ms. Allocated memory is still 153.1MB. Free memory was 117.1MB in the beginning and 116.9MB in the end (delta: 167.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 623.16ms. Allocated memory is still 153.1MB. Free memory was 95.3MB in the beginning and 73.8MB in the end (delta: 21.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 753]: 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_OAT_nondet_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:53:14,280 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:53:14,372 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-10 14:53:14,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:53:14,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:53:14,411 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:53:14,412 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:53:14,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:53:14,413 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 14:53:14,414 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 14:53:14,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:53:14,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:53:14,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:53:14,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:53:14,416 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:53:14,416 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:53:14,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:53:14,417 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:53:14,417 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:53:14,418 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:53:14,418 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:53:14,418 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:53:14,419 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 14:53:14,419 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 14:53:14,419 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:53:14,420 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:53:14,420 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 14:53:14,420 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 14:53:14,421 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:53:14,421 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 14:53:14,421 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:53:14,422 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:53:14,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:53:14,422 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:53:14,423 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:53:14,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:53:14,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 14:53:14,424 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:53:14,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:53:14,425 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:53:14,425 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:53:14,426 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 14:53:14,426 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 14:53:14,426 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:53:14,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:53:14,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:53:14,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:53:14,427 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2024-11-10 14:53:14,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:53:14,772 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:53:14,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:53:14,784 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:53:14,785 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:53:14,787 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i [2024-11-10 14:53:16,353 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:53:16,625 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:53:16,626 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test1-2.i [2024-11-10 14:53:16,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a53faa03/bbe15fe6369241ab92fe28fc20dabc8e/FLAG612927d80 [2024-11-10 14:53:16,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a53faa03/bbe15fe6369241ab92fe28fc20dabc8e [2024-11-10 14:53:16,664 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:53:16,665 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:53:16,666 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:53:16,666 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:53:16,672 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:53:16,672 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:53:16" (1/1) ... [2024-11-10 14:53:16,673 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee0b89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:16, skipping insertion in model container [2024-11-10 14:53:16,674 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:53:16" (1/1) ... [2024-11-10 14:53:16,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:53:17,187 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:17,229 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:17,233 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:17,239 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:17,249 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:17,265 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:17,267 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:17,269 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:17,270 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:17,271 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:17,272 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:17,277 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:17,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:53:17,300 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 14:53:17,313 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:53:17,343 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:17,361 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:17,363 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:17,365 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:17,369 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:17,385 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:17,386 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:17,387 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:17,388 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:17,389 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:17,390 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:17,392 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 14:53:17,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:53:17,398 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:53:17,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:53:17,538 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:53:17,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:17 WrapperNode [2024-11-10 14:53:17,539 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:53:17,540 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:53:17,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:53:17,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:53:17,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:17" (1/1) ... [2024-11-10 14:53:17,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:17" (1/1) ... [2024-11-10 14:53:17,630 INFO L138 Inliner]: procedures = 179, calls = 221, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 724 [2024-11-10 14:53:17,631 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:53:17,632 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:53:17,632 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:53:17,632 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:53:17,646 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:17" (1/1) ... [2024-11-10 14:53:17,647 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:17" (1/1) ... [2024-11-10 14:53:17,655 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:17" (1/1) ... [2024-11-10 14:53:17,714 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2024-11-10 14:53:17,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:17" (1/1) ... [2024-11-10 14:53:17,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:17" (1/1) ... [2024-11-10 14:53:17,741 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:17" (1/1) ... [2024-11-10 14:53:17,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:17" (1/1) ... [2024-11-10 14:53:17,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:17" (1/1) ... [2024-11-10 14:53:17,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:17" (1/1) ... [2024-11-10 14:53:17,757 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:53:17,758 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:53:17,758 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:53:17,758 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:53:17,759 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:17" (1/1) ... [2024-11-10 14:53:17,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:53:17,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:53:17,805 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-10 14:53:17,813 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-10 14:53:17,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 14:53:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 14:53:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 14:53:17,857 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 14:53:17,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 14:53:17,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 14:53:17,858 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 14:53:17,858 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 14:53:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:53:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:53:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 14:53:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 14:53:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 14:53:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 14:53:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:53:17,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 14:53:17,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 14:53:17,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 14:53:17,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 14:53:17,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:53:17,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:53:18,050 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:53:18,053 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:53:25,645 INFO L? ?]: Removed 109 outVars from TransFormulas that were not future-live. [2024-11-10 14:53:25,646 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:53:25,663 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:53:25,665 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:53:25,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:53:25 BoogieIcfgContainer [2024-11-10 14:53:25,666 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:53:25,668 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:53:25,668 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:53:25,672 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:53:25,672 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:53:16" (1/3) ... [2024-11-10 14:53:25,672 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1401fa78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:53:25, skipping insertion in model container [2024-11-10 14:53:25,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:53:17" (2/3) ... [2024-11-10 14:53:25,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1401fa78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:53:25, skipping insertion in model container [2024-11-10 14:53:25,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:53:25" (3/3) ... [2024-11-10 14:53:25,676 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test1-2.i [2024-11-10 14:53:25,693 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:53:25,693 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-10 14:53:25,750 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:53:25,757 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;@728f410a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:53:25,758 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-10 14:53:25,763 INFO L276 IsEmpty]: Start isEmpty. Operand has 145 states, 138 states have (on average 1.6159420289855073) internal successors, (223), 140 states have internal predecessors, (223), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 14:53:25,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 14:53:25,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:53:25,770 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:53:25,770 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:53:25,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:53:25,777 INFO L85 PathProgramCache]: Analyzing trace with hash 2011525640, now seen corresponding path program 1 times [2024-11-10 14:53:25,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:53:25,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [572260325] [2024-11-10 14:53:25,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:53:25,790 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-10 14:53:25,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:53:25,793 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-10 14:53:25,796 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-10 14:53:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:53:25,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 14:53:25,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:53:25,961 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-10 14:53:25,961 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:53:25,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:53:25,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [572260325] [2024-11-10 14:53:25,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [572260325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:53:25,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:53:25,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:53:25,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964417656] [2024-11-10 14:53:25,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:53:25,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 14:53:25,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:53:25,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 14:53:25,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:53:25,999 INFO L87 Difference]: Start difference. First operand has 145 states, 138 states have (on average 1.6159420289855073) internal successors, (223), 140 states have internal predecessors, (223), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:53:26,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:53:26,024 INFO L93 Difference]: Finished difference Result 144 states and 182 transitions. [2024-11-10 14:53:26,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 14:53:26,027 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-10 14:53:26,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:53:26,035 INFO L225 Difference]: With dead ends: 144 [2024-11-10 14:53:26,035 INFO L226 Difference]: Without dead ends: 141 [2024-11-10 14:53:26,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 14:53:26,044 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 14:53:26,045 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:53:26,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-10 14:53:26,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-10 14:53:26,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 135 states have (on average 1.2814814814814814) internal successors, (173), 136 states have internal predecessors, (173), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 14:53:26,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 179 transitions. [2024-11-10 14:53:26,095 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 179 transitions. Word has length 9 [2024-11-10 14:53:26,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:53:26,096 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 179 transitions. [2024-11-10 14:53:26,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:53:26,097 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 179 transitions. [2024-11-10 14:53:26,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 14:53:26,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:53:26,097 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:53:26,109 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-10 14:53:26,300 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-10 14:53:26,301 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:53:26,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:53:26,301 INFO L85 PathProgramCache]: Analyzing trace with hash 992601227, now seen corresponding path program 1 times [2024-11-10 14:53:26,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:53:26,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773767097] [2024-11-10 14:53:26,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:53:26,302 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-10 14:53:26,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:53:26,306 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-10 14:53:26,309 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-10 14:53:26,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:53:26,426 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 14:53:26,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:53:26,454 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-10 14:53:26,455 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:53:26,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:53:26,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773767097] [2024-11-10 14:53:26,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773767097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:53:26,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:53:26,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:53:26,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572441785] [2024-11-10 14:53:26,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:53:26,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:53:26,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:53:26,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:53:26,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:53:26,463 INFO L87 Difference]: Start difference. First operand 141 states and 179 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:53:26,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:53:26,651 INFO L93 Difference]: Finished difference Result 233 states and 297 transitions. [2024-11-10 14:53:26,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:53:26,661 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-10 14:53:26,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:53:26,663 INFO L225 Difference]: With dead ends: 233 [2024-11-10 14:53:26,663 INFO L226 Difference]: Without dead ends: 233 [2024-11-10 14:53:26,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:53:26,668 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 110 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 14:53:26,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 350 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 14:53:26,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-10 14:53:26,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 143. [2024-11-10 14:53:26,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 137 states have (on average 1.2773722627737227) internal successors, (175), 138 states have internal predecessors, (175), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 14:53:26,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 181 transitions. [2024-11-10 14:53:26,693 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 181 transitions. Word has length 11 [2024-11-10 14:53:26,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:53:26,694 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 181 transitions. [2024-11-10 14:53:26,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 14:53:26,694 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 181 transitions. [2024-11-10 14:53:26,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 14:53:26,698 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:53:26,698 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:53:26,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-10 14:53:26,899 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-10 14:53:26,900 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:53:26,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:53:26,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1509657037, now seen corresponding path program 1 times [2024-11-10 14:53:26,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:53:26,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435518982] [2024-11-10 14:53:26,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:53:26,903 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-10 14:53:26,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:53:26,905 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-10 14:53:26,906 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-10 14:53:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:53:27,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:53:27,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:53:27,278 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:53:27,278 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:53:27,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:53:27,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435518982] [2024-11-10 14:53:27,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435518982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:53:27,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:53:27,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:53:27,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311948398] [2024-11-10 14:53:27,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:53:27,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:53:27,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:53:27,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:53:27,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:53:27,281 INFO L87 Difference]: Start difference. First operand 143 states and 181 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-10 14:53:27,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:53:27,405 INFO L93 Difference]: Finished difference Result 146 states and 176 transitions. [2024-11-10 14:53:27,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:53:27,405 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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 68 [2024-11-10 14:53:27,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:53:27,407 INFO L225 Difference]: With dead ends: 146 [2024-11-10 14:53:27,407 INFO L226 Difference]: Without dead ends: 146 [2024-11-10 14:53:27,407 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 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-10 14:53:27,408 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 30 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:53:27,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 427 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:53:27,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-10 14:53:27,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-10 14:53:27,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 140 states have (on average 1.2142857142857142) internal successors, (170), 141 states have internal predecessors, (170), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 14:53:27,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 176 transitions. [2024-11-10 14:53:27,416 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 176 transitions. Word has length 68 [2024-11-10 14:53:27,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:53:27,416 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 176 transitions. [2024-11-10 14:53:27,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 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-10 14:53:27,417 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 176 transitions. [2024-11-10 14:53:27,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-10 14:53:27,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:53:27,418 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:53:27,431 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-10 14:53:27,619 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-10 14:53:27,619 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:53:27,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:53:27,620 INFO L85 PathProgramCache]: Analyzing trace with hash -736446547, now seen corresponding path program 1 times [2024-11-10 14:53:27,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:53:27,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030378317] [2024-11-10 14:53:27,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:53:27,621 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-10 14:53:27,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:53:27,624 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-10 14:53:27,625 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-10 14:53:27,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:53:27,937 INFO L255 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:53:27,939 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:53:28,234 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:53:28,235 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:53:28,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:53:28,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030378317] [2024-11-10 14:53:28,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1030378317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:53:28,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:53:28,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:53:28,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468953687] [2024-11-10 14:53:28,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:53:28,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:53:28,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:53:28,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:53:28,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:53:28,237 INFO L87 Difference]: Start difference. First operand 146 states and 176 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-10 14:53:29,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:53:29,034 INFO L93 Difference]: Finished difference Result 221 states and 264 transitions. [2024-11-10 14:53:29,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:53:29,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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 68 [2024-11-10 14:53:29,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:53:29,041 INFO L225 Difference]: With dead ends: 221 [2024-11-10 14:53:29,041 INFO L226 Difference]: Without dead ends: 221 [2024-11-10 14:53:29,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:53:29,042 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 43 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 14:53:29,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 341 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 14:53:29,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-10 14:53:29,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 189. [2024-11-10 14:53:29,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 183 states have (on average 1.185792349726776) internal successors, (217), 184 states have internal predecessors, (217), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-10 14:53:29,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 223 transitions. [2024-11-10 14:53:29,053 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 223 transitions. Word has length 68 [2024-11-10 14:53:29,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:53:29,053 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 223 transitions. [2024-11-10 14:53:29,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-10 14:53:29,053 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 223 transitions. [2024-11-10 14:53:29,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-10 14:53:29,055 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:53:29,056 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:53:29,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-10 14:53:29,256 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-10 14:53:29,257 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:53:29,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:53:29,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1873023458, now seen corresponding path program 1 times [2024-11-10 14:53:29,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:53:29,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46425154] [2024-11-10 14:53:29,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:53:29,258 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-10 14:53:29,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:53:29,281 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-10 14:53:29,296 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-10 14:53:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:53:29,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:53:29,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:53:29,751 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-10 14:53:29,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:53:29,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:53:29,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46425154] [2024-11-10 14:53:29,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46425154] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:53:29,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:53:29,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:53:29,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889136910] [2024-11-10 14:53:29,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:53:29,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:53:29,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:53:29,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:53:29,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:53:29,756 INFO L87 Difference]: Start difference. First operand 189 states and 223 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-10 14:53:29,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:53:29,792 INFO L93 Difference]: Finished difference Result 192 states and 227 transitions. [2024-11-10 14:53:29,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 14:53:29,792 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-10 14:53:29,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:53:29,795 INFO L225 Difference]: With dead ends: 192 [2024-11-10 14:53:29,795 INFO L226 Difference]: Without dead ends: 192 [2024-11-10 14:53:29,795 INFO L431 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-10 14:53:29,796 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 491 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-10 14:53:29,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 491 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 14:53:29,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-10 14:53:29,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2024-11-10 14:53:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 185 states have (on average 1.1891891891891893) internal successors, (220), 187 states have internal predecessors, (220), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 14:53:29,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 227 transitions. [2024-11-10 14:53:29,806 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 227 transitions. Word has length 83 [2024-11-10 14:53:29,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:53:29,806 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 227 transitions. [2024-11-10 14:53:29,807 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-10 14:53:29,807 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 227 transitions. [2024-11-10 14:53:29,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 14:53:29,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:53:29,809 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:53:29,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-10 14:53:30,010 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-10 14:53:30,010 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:53:30,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:53:30,011 INFO L85 PathProgramCache]: Analyzing trace with hash -362634778, now seen corresponding path program 1 times [2024-11-10 14:53:30,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:53:30,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642892628] [2024-11-10 14:53:30,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:53:30,012 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-10 14:53:30,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:53:30,015 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-10 14:53:30,016 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-10 14:53:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:53:30,384 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:53:30,387 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:53:30,421 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-10 14:53:30,421 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:53:30,519 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-10 14:53:30,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:53:30,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642892628] [2024-11-10 14:53:30,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642892628] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:53:30,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:53:30,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 14:53:30,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279061840] [2024-11-10 14:53:30,521 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:53:30,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:53:30,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:53:30,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:53:30,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:53:30,522 INFO L87 Difference]: Start difference. First operand 192 states and 227 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-10 14:53:30,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:53:30,675 INFO L93 Difference]: Finished difference Result 203 states and 243 transitions. [2024-11-10 14:53:30,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 14:53:30,676 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-10 14:53:30,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:53:30,678 INFO L225 Difference]: With dead ends: 203 [2024-11-10 14:53:30,678 INFO L226 Difference]: Without dead ends: 203 [2024-11-10 14:53:30,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-10 14:53:30,679 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 4 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 14:53:30,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 974 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 14:53:30,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-10 14:53:30,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2024-11-10 14:53:30,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 193 states have (on average 1.2124352331606219) internal successors, (234), 195 states have internal predecessors, (234), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 14:53:30,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 241 transitions. [2024-11-10 14:53:30,697 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 241 transitions. Word has length 85 [2024-11-10 14:53:30,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:53:30,697 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 241 transitions. [2024-11-10 14:53:30,697 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-10 14:53:30,698 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 241 transitions. [2024-11-10 14:53:30,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 14:53:30,700 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:53:30,700 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:53:30,715 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-10 14:53:30,900 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-10 14:53:30,901 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:53:30,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:53:30,902 INFO L85 PathProgramCache]: Analyzing trace with hash -752322526, now seen corresponding path program 2 times [2024-11-10 14:53:30,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:53:30,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663047392] [2024-11-10 14:53:30,902 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:53:30,902 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-10 14:53:30,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:53:30,904 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-10 14:53:30,905 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-10 14:53:31,272 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 14:53:31,273 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:53:31,289 INFO L255 TraceCheckSpWp]: Trace formula consists of 489 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-10 14:53:31,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:53:31,353 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-10 14:53:31,353 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:53:31,539 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-10 14:53:31,539 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:53:31,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663047392] [2024-11-10 14:53:31,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663047392] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:53:31,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:53:31,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-10 14:53:31,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529069694] [2024-11-10 14:53:31,540 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:53:31,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 14:53:31,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:53:31,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 14:53:31,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-10 14:53:31,542 INFO L87 Difference]: Start difference. First operand 201 states and 241 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-10 14:53:31,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:53:31,961 INFO L93 Difference]: Finished difference Result 216 states and 263 transitions. [2024-11-10 14:53:31,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 14:53:31,962 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-10 14:53:31,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:53:31,963 INFO L225 Difference]: With dead ends: 216 [2024-11-10 14:53:31,963 INFO L226 Difference]: Without dead ends: 212 [2024-11-10 14:53:31,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-10 14:53:31,965 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 7 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 14:53:31,965 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 984 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 14:53:31,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-10 14:53:31,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2024-11-10 14:53:31,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 202 states have (on average 1.2178217821782178) internal successors, (246), 204 states have internal predecessors, (246), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 14:53:31,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 253 transitions. [2024-11-10 14:53:31,972 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 253 transitions. Word has length 89 [2024-11-10 14:53:31,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:53:31,973 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 253 transitions. [2024-11-10 14:53:31,973 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-10 14:53:31,973 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 253 transitions. [2024-11-10 14:53:31,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 14:53:31,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:53:31,974 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:53:31,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-10 14:53:32,174 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-10 14:53:32,175 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:53:32,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:53:32,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1190293728, now seen corresponding path program 3 times [2024-11-10 14:53:32,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:53:32,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761865492] [2024-11-10 14:53:32,176 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 14:53:32,176 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-10 14:53:32,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:53:32,179 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-10 14:53:32,180 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-10 14:53:32,520 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-10 14:53:32,520 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:53:32,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 14:53:32,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:53:32,702 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-10 14:53:32,702 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 14:53:32,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:53:32,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761865492] [2024-11-10 14:53:32,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761865492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:53:32,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:53:32,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 14:53:32,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532167711] [2024-11-10 14:53:32,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:53:32,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 14:53:32,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:53:32,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 14:53:32,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 14:53:32,705 INFO L87 Difference]: Start difference. First operand 210 states and 253 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-10 14:53:36,966 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-10 14:53:40,972 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-10 14:53:43,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:53:43,320 INFO L93 Difference]: Finished difference Result 285 states and 347 transitions. [2024-11-10 14:53:43,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:53:43,323 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-10 14:53:43,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:53:43,324 INFO L225 Difference]: With dead ends: 285 [2024-11-10 14:53:43,324 INFO L226 Difference]: Without dead ends: 285 [2024-11-10 14:53:43,324 INFO L431 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-10 14:53:43,326 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 269 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2024-11-10 14:53:43,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 330 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 87 Invalid, 2 Unknown, 0 Unchecked, 10.6s Time] [2024-11-10 14:53:43,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-11-10 14:53:43,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 214. [2024-11-10 14:53:43,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 206 states have (on average 1.203883495145631) internal successors, (248), 208 states have internal predecessors, (248), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 14:53:43,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 255 transitions. [2024-11-10 14:53:43,337 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 255 transitions. Word has length 98 [2024-11-10 14:53:43,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:53:43,338 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 255 transitions. [2024-11-10 14:53:43,338 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-10 14:53:43,338 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 255 transitions. [2024-11-10 14:53:43,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-10 14:53:43,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:53:43,340 INFO L215 NwaCegarLoop]: trace histogram [15, 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-10 14:53:43,351 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-10 14:53:43,540 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-10 14:53:43,541 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:53:43,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:53:43,541 INFO L85 PathProgramCache]: Analyzing trace with hash -962053761, now seen corresponding path program 1 times [2024-11-10 14:53:43,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:53:43,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1098667034] [2024-11-10 14:53:43,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:53:43,542 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-10 14:53:43,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:53:43,544 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-10 14:53:43,545 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-10 14:53:43,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:53:44,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 14:53:44,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:53:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 71 proven. 55 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-10 14:53:44,168 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:53:44,685 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 2 proven. 123 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-10 14:53:44,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:53:44,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1098667034] [2024-11-10 14:53:44,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1098667034] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:53:44,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:53:44,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-10 14:53:44,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945221839] [2024-11-10 14:53:44,686 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:53:44,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 14:53:44,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:53:44,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 14:53:44,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-10 14:53:44,688 INFO L87 Difference]: Start difference. First operand 214 states and 255 transitions. Second operand has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 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-10 14:53:46,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:53:46,584 INFO L93 Difference]: Finished difference Result 238 states and 295 transitions. [2024-11-10 14:53:46,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-10 14:53:46,585 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 100 [2024-11-10 14:53:46,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:53:46,587 INFO L225 Difference]: With dead ends: 238 [2024-11-10 14:53:46,587 INFO L226 Difference]: Without dead ends: 234 [2024-11-10 14:53:46,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-10 14:53:46,588 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 13 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1949 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 14:53:46,589 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1949 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 14:53:46,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-11-10 14:53:46,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2024-11-10 14:53:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 224 states have (on average 1.2142857142857142) internal successors, (272), 226 states have internal predecessors, (272), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 14:53:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 279 transitions. [2024-11-10 14:53:46,595 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 279 transitions. Word has length 100 [2024-11-10 14:53:46,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:53:46,596 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 279 transitions. [2024-11-10 14:53:46,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.153846153846154) internal successors, (108), 26 states have internal predecessors, (108), 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-10 14:53:46,596 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 279 transitions. [2024-11-10 14:53:46,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 14:53:46,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:53:46,598 INFO L215 NwaCegarLoop]: trace histogram [33, 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-10 14:53:46,611 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-10 14:53:46,798 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-10 14:53:46,799 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:53:46,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:53:46,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1866419903, now seen corresponding path program 2 times [2024-11-10 14:53:46,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:53:46,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078888615] [2024-11-10 14:53:46,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:53:46,800 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-10 14:53:46,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:53:46,803 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-10 14:53:46,804 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-10 14:53:47,287 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 14:53:47,287 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:53:47,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 14:53:47,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:53:47,804 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 281 proven. 253 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-10 14:53:47,805 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:53:49,422 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 2 proven. 531 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-10 14:53:49,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:53:49,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078888615] [2024-11-10 14:53:49,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078888615] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:53:49,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:53:49,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-10 14:53:49,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581234588] [2024-11-10 14:53:49,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:53:49,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-10 14:53:49,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:53:49,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-10 14:53:49,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-10 14:53:49,425 INFO L87 Difference]: Start difference. First operand 232 states and 279 transitions. Second operand has 50 states, 50 states have (on average 2.64) internal successors, (132), 50 states have internal predecessors, (132), 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-10 14:53:55,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:53:55,400 INFO L93 Difference]: Finished difference Result 272 states and 351 transitions. [2024-11-10 14:53:55,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-10 14:53:55,402 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.64) internal successors, (132), 50 states have internal predecessors, (132), 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 118 [2024-11-10 14:53:55,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:53:55,404 INFO L225 Difference]: With dead ends: 272 [2024-11-10 14:53:55,404 INFO L226 Difference]: Without dead ends: 268 [2024-11-10 14:53:55,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-10 14:53:55,407 INFO L432 NwaCegarLoop]: 164 mSDtfsCounter, 25 mSDsluCounter, 4365 mSDsCounter, 0 mSdLazyCounter, 1924 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 4529 SdHoareTripleChecker+Invalid, 1949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 14:53:55,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 4529 Invalid, 1949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1924 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 14:53:55,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-10 14:53:55,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2024-11-10 14:53:55,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 258 states have (on average 1.2325581395348837) internal successors, (318), 260 states have internal predecessors, (318), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-10 14:53:55,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 325 transitions. [2024-11-10 14:53:55,413 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 325 transitions. Word has length 118 [2024-11-10 14:53:55,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:53:55,413 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 325 transitions. [2024-11-10 14:53:55,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.64) internal successors, (132), 50 states have internal predecessors, (132), 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-10 14:53:55,414 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 325 transitions. [2024-11-10 14:53:55,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-11-10 14:53:55,415 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:53:55,415 INFO L215 NwaCegarLoop]: trace histogram [67, 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-10 14:53:55,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-10 14:53:55,616 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-10 14:53:55,616 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:53:55,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:53:55,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1343946625, now seen corresponding path program 3 times [2024-11-10 14:53:55,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:53:55,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204607490] [2024-11-10 14:53:55,618 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 14:53:55,618 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-10 14:53:55,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:53:55,619 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-10 14:53:55,620 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-10 14:53:56,037 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-10 14:53:56,038 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:53:56,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 14:53:56,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:53:56,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2351 trivial. 0 not checked. [2024-11-10 14:53:56,182 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:53:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2353 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2351 trivial. 0 not checked. [2024-11-10 14:53:56,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:53:56,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204607490] [2024-11-10 14:53:56,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204607490] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:53:56,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:53:56,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-10 14:53:56,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702255320] [2024-11-10 14:53:56,344 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:53:56,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:53:56,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:53:56,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:53:56,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:53:56,346 INFO L87 Difference]: Start difference. First operand 266 states and 325 transitions. Second operand has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 14:53:56,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:53:56,588 INFO L93 Difference]: Finished difference Result 479 states and 582 transitions. [2024-11-10 14:53:56,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:53:56,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 152 [2024-11-10 14:53:56,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:53:56,591 INFO L225 Difference]: With dead ends: 479 [2024-11-10 14:53:56,591 INFO L226 Difference]: Without dead ends: 479 [2024-11-10 14:53:56,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-10 14:53:56,592 INFO L432 NwaCegarLoop]: 253 mSDtfsCounter, 423 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 14:53:56,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 656 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 14:53:56,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-11-10 14:53:56,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2024-11-10 14:53:56,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 468 states have (on average 1.2094017094017093) internal successors, (566), 470 states have internal predecessors, (566), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-10 14:53:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 582 transitions. [2024-11-10 14:53:56,603 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 582 transitions. Word has length 152 [2024-11-10 14:53:56,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:53:56,603 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 582 transitions. [2024-11-10 14:53:56,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.833333333333332) internal successors, (143), 6 states have internal predecessors, (143), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-10 14:53:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 582 transitions. [2024-11-10 14:53:56,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2024-11-10 14:53:56,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:53:56,607 INFO L215 NwaCegarLoop]: trace histogram [67, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2024-11-10 14:53:56,618 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-10 14:53:56,812 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-10 14:53:56,813 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:53:56,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:53:56,813 INFO L85 PathProgramCache]: Analyzing trace with hash -316454505, now seen corresponding path program 1 times [2024-11-10 14:53:56,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:53:56,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462990771] [2024-11-10 14:53:56,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:53:56,814 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-10 14:53:56,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:53:56,816 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-10 14:53:56,816 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-10 14:53:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:53:58,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 1963 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-10 14:53:58,397 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:53:58,924 INFO L134 CoverageAnalysis]: Checked inductivity of 2695 backedges. 1201 proven. 276 refuted. 0 times theorem prover too weak. 1218 trivial. 0 not checked. [2024-11-10 14:53:58,924 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:54:00,554 INFO L134 CoverageAnalysis]: Checked inductivity of 2695 backedges. 1201 proven. 276 refuted. 0 times theorem prover too weak. 1218 trivial. 0 not checked. [2024-11-10 14:54:00,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:54:00,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462990771] [2024-11-10 14:54:00,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [462990771] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:54:00,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:54:00,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-10 14:54:00,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836750703] [2024-11-10 14:54:00,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:54:00,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-10 14:54:00,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:54:00,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-10 14:54:00,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-10 14:54:00,557 INFO L87 Difference]: Start difference. First operand 479 states and 582 transitions. Second operand has 52 states, 52 states have (on average 3.269230769230769) internal successors, (170), 52 states have internal predecessors, (170), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 14:54:06,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 14:54:06,883 INFO L93 Difference]: Finished difference Result 508 states and 642 transitions. [2024-11-10 14:54:06,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-10 14:54:06,884 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.269230769230769) internal successors, (170), 52 states have internal predecessors, (170), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 323 [2024-11-10 14:54:06,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 14:54:06,886 INFO L225 Difference]: With dead ends: 508 [2024-11-10 14:54:06,886 INFO L226 Difference]: Without dead ends: 508 [2024-11-10 14:54:06,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 691 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-10 14:54:06,889 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 26 mSDsluCounter, 4187 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 4350 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 14:54:06,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 4350 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 14:54:06,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2024-11-10 14:54:06,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 504. [2024-11-10 14:54:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 493 states have (on average 1.2494929006085194) internal successors, (616), 495 states have internal predecessors, (616), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-10 14:54:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 632 transitions. [2024-11-10 14:54:06,902 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 632 transitions. Word has length 323 [2024-11-10 14:54:06,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 14:54:06,902 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 632 transitions. [2024-11-10 14:54:06,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.269230769230769) internal successors, (170), 52 states have internal predecessors, (170), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 14:54:06,903 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 632 transitions. [2024-11-10 14:54:06,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2024-11-10 14:54:06,905 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 14:54:06,905 INFO L215 NwaCegarLoop]: trace histogram [92, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2024-11-10 14:54:06,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2024-11-10 14:54:07,105 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-10 14:54:07,106 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-10 14:54:07,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:54:07,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1396891989, now seen corresponding path program 2 times [2024-11-10 14:54:07,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 14:54:07,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1991799296] [2024-11-10 14:54:07,107 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 14:54:07,108 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-10 14:54:07,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 14:54:07,110 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-10 14:54:07,111 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-10 14:54:09,155 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 14:54:09,155 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 14:54:09,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 2238 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-10 14:54:09,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 14:54:10,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4720 backedges. 2326 proven. 1176 refuted. 0 times theorem prover too weak. 1218 trivial. 0 not checked. [2024-11-10 14:54:10,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 14:54:16,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4720 backedges. 2326 proven. 1176 refuted. 0 times theorem prover too weak. 1218 trivial. 0 not checked. [2024-11-10 14:54:16,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 14:54:16,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1991799296] [2024-11-10 14:54:16,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1991799296] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 14:54:16,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 14:54:16,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-10 14:54:16,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735961097] [2024-11-10 14:54:16,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 14:54:16,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-10 14:54:16,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 14:54:16,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-10 14:54:16,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-10 14:54:16,968 INFO L87 Difference]: Start difference. First operand 504 states and 632 transitions. Second operand has 102 states, 102 states have (on average 2.156862745098039) internal successors, (220), 102 states have internal predecessors, (220), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)