./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4a058bd9944921e52018f99044f11f694f824f3f09daf510330544b4558ba193 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 02:51:38,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 02:51:38,323 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 02:51:38,328 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 02:51:38,328 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 02:51:38,360 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 02:51:38,361 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 02:51:38,362 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 02:51:38,363 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 02:51:38,364 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 02:51:38,364 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 02:51:38,365 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 02:51:38,365 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 02:51:38,367 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 02:51:38,368 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 02:51:38,368 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 02:51:38,369 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 02:51:38,369 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 02:51:38,369 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 02:51:38,370 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 02:51:38,370 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 02:51:38,375 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 02:51:38,375 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 02:51:38,375 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 02:51:38,375 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 02:51:38,376 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 02:51:38,376 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 02:51:38,376 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 02:51:38,377 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 02:51:38,377 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 02:51:38,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 02:51:38,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 02:51:38,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 02:51:38,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:51:38,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 02:51:38,379 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 02:51:38,379 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 02:51:38,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 02:51:38,380 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 02:51:38,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 02:51:38,380 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 02:51:38,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 02:51:38,381 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 4a058bd9944921e52018f99044f11f694f824f3f09daf510330544b4558ba193 [2024-11-17 02:51:38,651 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 02:51:38,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 02:51:38,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 02:51:38,680 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 02:51:38,680 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 02:51:38,681 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i [2024-11-17 02:51:40,094 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 02:51:40,443 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 02:51:40,445 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i [2024-11-17 02:51:40,466 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0025b3935/5ad2b4bcf8c54c079c3d90ab6e78a766/FLAGe3b60d62a [2024-11-17 02:51:40,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0025b3935/5ad2b4bcf8c54c079c3d90ab6e78a766 [2024-11-17 02:51:40,485 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 02:51:40,487 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 02:51:40,490 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 02:51:40,490 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 02:51:40,496 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 02:51:40,497 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:51:40" (1/1) ... [2024-11-17 02:51:40,498 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d9998ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:51:40, skipping insertion in model container [2024-11-17 02:51:40,500 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:51:40" (1/1) ... [2024-11-17 02:51:40,563 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:51:41,101 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-17 02:51:41,141 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-17 02:51:41,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-17 02:51:41,165 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-17 02:51:41,177 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-17 02:51:41,222 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-17 02:51:41,225 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-17 02:51:41,227 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-17 02:51:41,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-17 02:51:41,232 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-17 02:51:41,236 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-17 02:51:41,237 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-17 02:51:41,237 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-17 02:51:41,243 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-17 02:51:41,248 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-17 02:51:41,254 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-17 02:51:41,255 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-17 02:51:41,256 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-17 02:51:41,256 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-17 02:51:41,263 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-17 02:51:41,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:51:41,289 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-17 02:51:41,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@b58848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:51:41, skipping insertion in model container [2024-11-17 02:51:41,291 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 02:51:41,292 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-17 02:51:41,294 INFO L158 Benchmark]: Toolchain (without parser) took 806.56ms. Allocated memory was 148.9MB in the beginning and 199.2MB in the end (delta: 50.3MB). Free memory was 90.3MB in the beginning and 162.0MB in the end (delta: -71.7MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2024-11-17 02:51:41,295 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 148.9MB. Free memory is still 107.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 02:51:41,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 802.02ms. Allocated memory was 148.9MB in the beginning and 199.2MB in the end (delta: 50.3MB). Free memory was 90.0MB in the beginning and 162.0MB in the end (delta: -72.0MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. [2024-11-17 02:51:41,297 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.13ms. Allocated memory is still 148.9MB. Free memory is still 107.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 802.02ms. Allocated memory was 148.9MB in the beginning and 199.2MB in the end (delta: 50.3MB). Free memory was 90.0MB in the beginning and 162.0MB in the end (delta: -72.0MB). Peak memory consumption was 27.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1001]: 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_JEN_test6-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4a058bd9944921e52018f99044f11f694f824f3f09daf510330544b4558ba193 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 02:51:43,288 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 02:51:43,379 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 02:51:43,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 02:51:43,387 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 02:51:43,413 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 02:51:43,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 02:51:43,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 02:51:43,414 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 02:51:43,415 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 02:51:43,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 02:51:43,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 02:51:43,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 02:51:43,418 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 02:51:43,419 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 02:51:43,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 02:51:43,419 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 02:51:43,420 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 02:51:43,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 02:51:43,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 02:51:43,420 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 02:51:43,424 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 02:51:43,424 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 02:51:43,425 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 02:51:43,425 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 02:51:43,425 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 02:51:43,425 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 02:51:43,426 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 02:51:43,426 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 02:51:43,426 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 02:51:43,426 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 02:51:43,426 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 02:51:43,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 02:51:43,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 02:51:43,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 02:51:43,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:51:43,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 02:51:43,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 02:51:43,428 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 02:51:43,428 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 02:51:43,428 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 02:51:43,429 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 02:51:43,429 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 02:51:43,430 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 02:51:43,430 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 4a058bd9944921e52018f99044f11f694f824f3f09daf510330544b4558ba193 [2024-11-17 02:51:43,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 02:51:43,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 02:51:43,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 02:51:43,777 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 02:51:43,778 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 02:51:43,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i [2024-11-17 02:51:45,359 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 02:51:45,665 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 02:51:45,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i [2024-11-17 02:51:45,684 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837a0de72/9d23afa632d945e1bc6efb7e8ea2055b/FLAG0e0787b11 [2024-11-17 02:51:45,696 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/837a0de72/9d23afa632d945e1bc6efb7e8ea2055b [2024-11-17 02:51:45,708 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 02:51:45,709 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 02:51:45,710 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 02:51:45,710 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 02:51:45,714 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 02:51:45,715 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:51:45" (1/1) ... [2024-11-17 02:51:45,716 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5509db47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:51:45, skipping insertion in model container [2024-11-17 02:51:45,716 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:51:45" (1/1) ... [2024-11-17 02:51:45,779 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:51:46,359 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-17 02:51:46,399 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-17 02:51:46,404 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-17 02:51:46,409 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-17 02:51:46,420 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-17 02:51:46,465 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-17 02:51:46,468 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-17 02:51:46,470 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-17 02:51:46,471 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-17 02:51:46,474 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-17 02:51:46,479 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-17 02:51:46,480 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-17 02:51:46,481 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-17 02:51:46,486 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-17 02:51:46,489 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-17 02:51:46,495 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-17 02:51:46,500 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-17 02:51:46,501 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-17 02:51:46,501 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-17 02:51:46,504 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-17 02:51:46,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:51:46,540 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-17 02:51:46,564 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:51:46,613 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-17 02:51:46,628 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-17 02:51:46,632 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-17 02:51:46,634 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-17 02:51:46,640 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-17 02:51:46,655 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-17 02:51:46,656 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-17 02:51:46,657 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-17 02:51:46,658 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-17 02:51:46,659 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-17 02:51:46,660 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-17 02:51:46,661 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-17 02:51:46,661 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-17 02:51:46,663 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-17 02:51:46,664 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-17 02:51:46,665 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-17 02:51:46,666 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-17 02:51:46,666 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-17 02:51:46,667 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-17 02:51:46,669 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-17 02:51:46,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:51:46,676 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 02:51:46,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:51:46,842 INFO L204 MainTranslator]: Completed translation [2024-11-17 02:51:46,843 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:51:46 WrapperNode [2024-11-17 02:51:46,843 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 02:51:46,844 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 02:51:46,844 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 02:51:46,844 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 02:51:46,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:51:46" (1/1) ... [2024-11-17 02:51:46,902 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:51:46" (1/1) ... [2024-11-17 02:51:46,967 INFO L138 Inliner]: procedures = 286, calls = 353, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1203 [2024-11-17 02:51:46,967 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 02:51:46,968 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 02:51:46,968 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 02:51:46,968 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 02:51:46,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:51:46" (1/1) ... [2024-11-17 02:51:46,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:51:46" (1/1) ... [2024-11-17 02:51:46,989 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:51:46" (1/1) ... [2024-11-17 02:51:47,098 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [2, 12, 34, 270]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 10, 0, 0]. The 62 writes are split as follows [0, 1, 4, 57]. [2024-11-17 02:51:47,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:51:46" (1/1) ... [2024-11-17 02:51:47,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:51:46" (1/1) ... [2024-11-17 02:51:47,162 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:51:46" (1/1) ... [2024-11-17 02:51:47,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:51:46" (1/1) ... [2024-11-17 02:51:47,174 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:51:46" (1/1) ... [2024-11-17 02:51:47,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:51:46" (1/1) ... [2024-11-17 02:51:47,196 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 02:51:47,198 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 02:51:47,198 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 02:51:47,198 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 02:51:47,199 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:51:46" (1/1) ... [2024-11-17 02:51:47,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:51:47,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:51:47,232 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-17 02:51:47,234 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-17 02:51:47,271 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-17 02:51:47,271 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-17 02:51:47,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-17 02:51:47,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-17 02:51:47,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-17 02:51:47,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-17 02:51:47,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-17 02:51:47,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-17 02:51:47,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-17 02:51:47,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-17 02:51:47,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 02:51:47,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 02:51:47,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 02:51:47,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 02:51:47,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-17 02:51:47,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 02:51:47,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 02:51:47,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-17 02:51:47,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-17 02:51:47,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-17 02:51:47,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 02:51:47,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-17 02:51:47,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-17 02:51:47,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-17 02:51:47,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-17 02:51:47,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-17 02:51:47,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-17 02:51:47,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-17 02:51:47,275 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-17 02:51:47,275 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-17 02:51:47,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 02:51:47,275 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 02:51:47,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 02:51:47,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 02:51:47,276 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-17 02:51:47,276 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-17 02:51:47,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 02:51:47,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 02:51:47,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 02:51:47,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-17 02:51:47,281 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-17 02:51:47,281 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-17 02:51:47,281 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 02:51:47,281 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 02:51:47,544 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 02:51:47,546 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 02:51:47,650 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: havoc #t~malloc32.base, #t~malloc32.offset; [2024-11-17 02:51:51,414 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: havoc alt_memcmp_#t~nondet36#1; [2024-11-17 02:51:51,414 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; [2024-11-17 02:51:51,415 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L987: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-17 02:51:51,523 INFO L? ?]: Removed 1306 outVars from TransFormulas that were not future-live. [2024-11-17 02:51:51,524 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 02:51:51,568 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 02:51:51,568 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 02:51:51,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:51:51 BoogieIcfgContainer [2024-11-17 02:51:51,582 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 02:51:51,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 02:51:51,587 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 02:51:51,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 02:51:51,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 02:51:45" (1/3) ... [2024-11-17 02:51:51,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5a9dd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:51:51, skipping insertion in model container [2024-11-17 02:51:51,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:51:46" (2/3) ... [2024-11-17 02:51:51,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b5a9dd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:51:51, skipping insertion in model container [2024-11-17 02:51:51,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:51:51" (3/3) ... [2024-11-17 02:51:51,595 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test6-2.i [2024-11-17 02:51:51,611 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 02:51:51,611 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 625 error locations. [2024-11-17 02:51:51,700 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 02:51:51,707 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;@1afb3975, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 02:51:51,707 INFO L334 AbstractCegarLoop]: Starting to check reachability of 625 error locations. [2024-11-17 02:51:51,717 INFO L276 IsEmpty]: Start isEmpty. Operand has 1315 states, 664 states have (on average 2.161144578313253) internal successors, (1435), 1293 states have internal predecessors, (1435), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-17 02:51:51,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 02:51:51,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:51:51,726 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 02:51:51,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr613REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:51:51,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:51:51,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1476558, now seen corresponding path program 1 times [2024-11-17 02:51:51,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:51:51,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793992028] [2024-11-17 02:51:51,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:51:51,747 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-17 02:51:51,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:51:51,750 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-17 02:51:51,772 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-17 02:51:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:51:51,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:51:51,960 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:51:52,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:51:52,043 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-17 02:51:52,044 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:51:52,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:51:52,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793992028] [2024-11-17 02:51:52,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793992028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:51:52,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:51:52,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:51:52,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146131758] [2024-11-17 02:51:52,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:51:52,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:51:52,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:51:52,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:51:52,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:51:52,080 INFO L87 Difference]: Start difference. First operand has 1315 states, 664 states have (on average 2.161144578313253) internal successors, (1435), 1293 states have internal predecessors, (1435), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-17 02:51:53,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:51:53,740 INFO L93 Difference]: Finished difference Result 1583 states and 1676 transitions. [2024-11-17 02:51:53,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:51:53,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-17 02:51:53,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:51:53,760 INFO L225 Difference]: With dead ends: 1583 [2024-11-17 02:51:53,760 INFO L226 Difference]: Without dead ends: 1580 [2024-11-17 02:51:53,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-17 02:51:53,765 INFO L432 NwaCegarLoop]: 940 mSDtfsCounter, 939 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:51:53,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 1299 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-17 02:51:53,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2024-11-17 02:51:53,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1337. [2024-11-17 02:51:53,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 702 states have (on average 2.02991452991453) internal successors, (1425), 1317 states have internal predecessors, (1425), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-17 02:51:53,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1459 transitions. [2024-11-17 02:51:53,861 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1459 transitions. Word has length 3 [2024-11-17 02:51:53,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:51:53,861 INFO L471 AbstractCegarLoop]: Abstraction has 1337 states and 1459 transitions. [2024-11-17 02:51:53,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-17 02:51:53,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1459 transitions. [2024-11-17 02:51:53,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-17 02:51:53,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:51:53,862 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-17 02:51:53,866 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-17 02:51:54,065 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-17 02:51:54,066 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr614REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:51:54,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:51:54,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1476559, now seen corresponding path program 1 times [2024-11-17 02:51:54,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:51:54,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348863425] [2024-11-17 02:51:54,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:51:54,067 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-17 02:51:54,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:51:54,069 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-17 02:51:54,069 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-17 02:51:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:51:54,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:51:54,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:51:54,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:51:54,241 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-17 02:51:54,242 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:51:54,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:51:54,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348863425] [2024-11-17 02:51:54,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348863425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:51:54,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:51:54,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:51:54,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578793359] [2024-11-17 02:51:54,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:51:54,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:51:54,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:51:54,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:51:54,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:51:54,247 INFO L87 Difference]: Start difference. First operand 1337 states and 1459 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-17 02:51:56,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:51:56,565 INFO L93 Difference]: Finished difference Result 1958 states and 2130 transitions. [2024-11-17 02:51:56,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:51:56,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-17 02:51:56,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:51:56,572 INFO L225 Difference]: With dead ends: 1958 [2024-11-17 02:51:56,573 INFO L226 Difference]: Without dead ends: 1958 [2024-11-17 02:51:56,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-17 02:51:56,574 INFO L432 NwaCegarLoop]: 1078 mSDtfsCounter, 654 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-17 02:51:56,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1819 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-17 02:51:56,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2024-11-17 02:51:56,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1563. [2024-11-17 02:51:56,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 927 states have (on average 2.0097087378640777) internal successors, (1863), 1541 states have internal predecessors, (1863), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-17 02:51:56,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 1901 transitions. [2024-11-17 02:51:56,627 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 1901 transitions. Word has length 3 [2024-11-17 02:51:56,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:51:56,628 INFO L471 AbstractCegarLoop]: Abstraction has 1563 states and 1901 transitions. [2024-11-17 02:51:56,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-17 02:51:56,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1901 transitions. [2024-11-17 02:51:56,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 02:51:56,628 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:51:56,629 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:51:56,633 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-17 02:51:56,829 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-17 02:51:56,830 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr610REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:51:56,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:51:56,831 INFO L85 PathProgramCache]: Analyzing trace with hash -610856126, now seen corresponding path program 1 times [2024-11-17 02:51:56,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:51:56,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188570663] [2024-11-17 02:51:56,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:51:56,832 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-17 02:51:56,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:51:56,835 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-17 02:51:56,836 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-17 02:51:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:51:57,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 02:51:57,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:51:57,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:51:57,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:51:57,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 02:51:57,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 02:51:57,128 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 02:51:57,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-17 02:51:57,162 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-17 02:51:57,163 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:51:57,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:51:57,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188570663] [2024-11-17 02:51:57,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1188570663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:51:57,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:51:57,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:51:57,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582532990] [2024-11-17 02:51:57,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:51:57,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:51:57,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:51:57,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:51:57,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:51:57,165 INFO L87 Difference]: Start difference. First operand 1563 states and 1901 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-17 02:52:00,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:52:00,850 INFO L93 Difference]: Finished difference Result 2679 states and 3098 transitions. [2024-11-17 02:52:00,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:52:00,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-17 02:52:00,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:52:00,859 INFO L225 Difference]: With dead ends: 2679 [2024-11-17 02:52:00,860 INFO L226 Difference]: Without dead ends: 2679 [2024-11-17 02:52:00,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:52:00,863 INFO L432 NwaCegarLoop]: 734 mSDtfsCounter, 2093 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2099 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:52:00,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2099 Valid, 1535 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-17 02:52:00,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2679 states. [2024-11-17 02:52:00,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2679 to 1717. [2024-11-17 02:52:00,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1717 states, 1081 states have (on average 1.9935245143385754) internal successors, (2155), 1695 states have internal predecessors, (2155), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-17 02:52:00,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 2193 transitions. [2024-11-17 02:52:00,906 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 2193 transitions. Word has length 9 [2024-11-17 02:52:00,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:52:00,908 INFO L471 AbstractCegarLoop]: Abstraction has 1717 states and 2193 transitions. [2024-11-17 02:52:00,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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-17 02:52:00,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2193 transitions. [2024-11-17 02:52:00,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 02:52:00,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:52:00,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:52:00,918 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-17 02:52:01,112 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-17 02:52:01,113 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr607REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:52:01,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:52:01,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1756669350, now seen corresponding path program 1 times [2024-11-17 02:52:01,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:52:01,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338080397] [2024-11-17 02:52:01,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:52:01,115 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-17 02:52:01,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:52:01,117 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-17 02:52:01,118 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-17 02:52:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:52:01,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:52:01,262 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:52:01,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:52:01,290 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-17 02:52:01,291 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:52:01,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:52:01,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338080397] [2024-11-17 02:52:01,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338080397] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:52:01,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:52:01,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:52:01,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225205496] [2024-11-17 02:52:01,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:52:01,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:52:01,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:52:01,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:52:01,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:52:01,292 INFO L87 Difference]: Start difference. First operand 1717 states and 2193 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-17 02:52:03,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:52:03,482 INFO L93 Difference]: Finished difference Result 2289 states and 2993 transitions. [2024-11-17 02:52:03,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:52:03,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-17 02:52:03,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:52:03,490 INFO L225 Difference]: With dead ends: 2289 [2024-11-17 02:52:03,490 INFO L226 Difference]: Without dead ends: 2289 [2024-11-17 02:52:03,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-17 02:52:03,491 INFO L432 NwaCegarLoop]: 1269 mSDtfsCounter, 946 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 1694 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 2618 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:52:03,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 2618 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1694 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-17 02:52:03,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2024-11-17 02:52:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 1672. [2024-11-17 02:52:03,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1081 states have (on average 1.938945420906568) internal successors, (2096), 1650 states have internal predecessors, (2096), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-17 02:52:03,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2134 transitions. [2024-11-17 02:52:03,525 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2134 transitions. Word has length 10 [2024-11-17 02:52:03,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:52:03,526 INFO L471 AbstractCegarLoop]: Abstraction has 1672 states and 2134 transitions. [2024-11-17 02:52:03,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-17 02:52:03,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2134 transitions. [2024-11-17 02:52:03,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 02:52:03,527 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:52:03,527 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:52:03,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-17 02:52:03,730 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-17 02:52:03,731 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr608REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:52:03,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:52:03,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1756669349, now seen corresponding path program 1 times [2024-11-17 02:52:03,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:52:03,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485641633] [2024-11-17 02:52:03,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:52:03,732 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-17 02:52:03,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:52:03,733 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-17 02:52:03,734 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-17 02:52:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:52:03,874 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 02:52:03,877 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:52:03,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:52:03,936 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-17 02:52:03,936 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:52:03,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:52:03,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485641633] [2024-11-17 02:52:03,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485641633] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:52:03,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:52:03,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:52:03,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300325512] [2024-11-17 02:52:03,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:52:03,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:52:03,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:52:03,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:52:03,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:52:03,938 INFO L87 Difference]: Start difference. First operand 1672 states and 2134 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-17 02:52:06,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:52:06,573 INFO L93 Difference]: Finished difference Result 2354 states and 3016 transitions. [2024-11-17 02:52:06,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:52:06,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2024-11-17 02:52:06,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:52:06,580 INFO L225 Difference]: With dead ends: 2354 [2024-11-17 02:52:06,580 INFO L226 Difference]: Without dead ends: 2354 [2024-11-17 02:52:06,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-17 02:52:06,581 INFO L432 NwaCegarLoop]: 1446 mSDtfsCounter, 723 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 2983 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:52:06,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 2983 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-17 02:52:06,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2024-11-17 02:52:06,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 1664. [2024-11-17 02:52:06,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1664 states, 1083 states have (on average 1.915050784856879) internal successors, (2074), 1642 states have internal predecessors, (2074), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-17 02:52:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2112 transitions. [2024-11-17 02:52:06,630 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2112 transitions. Word has length 10 [2024-11-17 02:52:06,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:52:06,630 INFO L471 AbstractCegarLoop]: Abstraction has 1664 states and 2112 transitions. [2024-11-17 02:52:06,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-17 02:52:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2112 transitions. [2024-11-17 02:52:06,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 02:52:06,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:52:06,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:52:06,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-17 02:52:06,832 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-17 02:52:06,833 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:52:06,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:52:06,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1224117696, now seen corresponding path program 1 times [2024-11-17 02:52:06,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:52:06,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1879519037] [2024-11-17 02:52:06,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:52:06,835 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-17 02:52:06,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:52:06,838 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-17 02:52:06,839 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-17 02:52:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:52:06,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 02:52:06,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:52:07,077 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-17 02:52:07,077 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:52:07,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:52:07,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1879519037] [2024-11-17 02:52:07,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1879519037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:52:07,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:52:07,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:52:07,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689149486] [2024-11-17 02:52:07,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:52:07,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:52:07,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:52:07,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:52:07,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:52:07,081 INFO L87 Difference]: Start difference. First operand 1664 states and 2112 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:52:07,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:52:07,690 INFO L93 Difference]: Finished difference Result 2306 states and 2899 transitions. [2024-11-17 02:52:07,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:52:07,691 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-17 02:52:07,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:52:07,697 INFO L225 Difference]: With dead ends: 2306 [2024-11-17 02:52:07,698 INFO L226 Difference]: Without dead ends: 2306 [2024-11-17 02:52:07,698 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-17 02:52:07,699 INFO L432 NwaCegarLoop]: 1489 mSDtfsCounter, 655 mSDsluCounter, 2561 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 4050 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:52:07,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 4050 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 02:52:07,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2024-11-17 02:52:07,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 1936. [2024-11-17 02:52:07,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1352 states have (on average 1.9230769230769231) internal successors, (2600), 1911 states have internal predecessors, (2600), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-17 02:52:07,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2644 transitions. [2024-11-17 02:52:07,733 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2644 transitions. Word has length 16 [2024-11-17 02:52:07,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:52:07,733 INFO L471 AbstractCegarLoop]: Abstraction has 1936 states and 2644 transitions. [2024-11-17 02:52:07,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:52:07,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2644 transitions. [2024-11-17 02:52:07,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-17 02:52:07,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:52:07,734 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:52:07,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-17 02:52:07,938 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-17 02:52:07,938 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr291REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:52:07,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:52:07,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1224364623, now seen corresponding path program 1 times [2024-11-17 02:52:07,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:52:07,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1091431555] [2024-11-17 02:52:07,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:52:07,939 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-17 02:52:07,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:52:07,941 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-17 02:52:07,942 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-17 02:52:08,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:52:08,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 02:52:08,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:52:08,129 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-17 02:52:08,129 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:52:08,129 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:52:08,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1091431555] [2024-11-17 02:52:08,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1091431555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:52:08,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:52:08,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:52:08,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215271563] [2024-11-17 02:52:08,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:52:08,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:52:08,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:52:08,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:52:08,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:52:08,132 INFO L87 Difference]: Start difference. First operand 1936 states and 2644 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-17 02:52:08,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:52:08,166 INFO L93 Difference]: Finished difference Result 1840 states and 2472 transitions. [2024-11-17 02:52:08,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:52:08,166 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2024-11-17 02:52:08,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:52:08,171 INFO L225 Difference]: With dead ends: 1840 [2024-11-17 02:52:08,171 INFO L226 Difference]: Without dead ends: 1840 [2024-11-17 02:52:08,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-17 02:52:08,172 INFO L432 NwaCegarLoop]: 1259 mSDtfsCounter, 71 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2454 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:52:08,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2454 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:52:08,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2024-11-17 02:52:08,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1840. [2024-11-17 02:52:08,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1280 states have (on average 1.896875) internal successors, (2428), 1815 states have internal predecessors, (2428), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-17 02:52:08,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2472 transitions. [2024-11-17 02:52:08,202 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2472 transitions. Word has length 16 [2024-11-17 02:52:08,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:52:08,202 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2472 transitions. [2024-11-17 02:52:08,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-17 02:52:08,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2472 transitions. [2024-11-17 02:52:08,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 02:52:08,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:52:08,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:52:08,209 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-17 02:52:08,407 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-17 02:52:08,408 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:52:08,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:52:08,409 INFO L85 PathProgramCache]: Analyzing trace with hash -429465059, now seen corresponding path program 1 times [2024-11-17 02:52:08,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:52:08,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973899994] [2024-11-17 02:52:08,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:52:08,410 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-17 02:52:08,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:52:08,411 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-17 02:52:08,412 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-17 02:52:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:52:08,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:52:08,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:52:08,618 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 02:52:08,619 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 02:52:08,620 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 02:52:08,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-17 02:52:08,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 02:52:08,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-17 02:52:08,703 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-17 02:52:08,705 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:52:08,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:52:08,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973899994] [2024-11-17 02:52:08,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1973899994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:52:08,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:52:08,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:52:08,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192026113] [2024-11-17 02:52:08,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:52:08,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:52:08,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:52:08,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:52:08,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:52:08,707 INFO L87 Difference]: Start difference. First operand 1840 states and 2472 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:52:09,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:52:09,021 INFO L93 Difference]: Finished difference Result 2573 states and 3007 transitions. [2024-11-17 02:52:09,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:52:09,022 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 02:52:09,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:52:09,028 INFO L225 Difference]: With dead ends: 2573 [2024-11-17 02:52:09,028 INFO L226 Difference]: Without dead ends: 2573 [2024-11-17 02:52:09,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-17 02:52:09,029 INFO L432 NwaCegarLoop]: 1454 mSDtfsCounter, 1132 mSDsluCounter, 2672 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 4126 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-17 02:52:09,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 4126 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-17 02:52:09,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2024-11-17 02:52:09,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 1488. [2024-11-17 02:52:09,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 930 states have (on average 1.8903225806451613) internal successors, (1758), 1465 states have internal predecessors, (1758), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-17 02:52:09,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1798 transitions. [2024-11-17 02:52:09,053 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1798 transitions. Word has length 19 [2024-11-17 02:52:09,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:52:09,053 INFO L471 AbstractCegarLoop]: Abstraction has 1488 states and 1798 transitions. [2024-11-17 02:52:09,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:52:09,054 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1798 transitions. [2024-11-17 02:52:09,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 02:52:09,054 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:52:09,054 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:52:09,061 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-17 02:52:09,258 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-17 02:52:09,259 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr599REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:52:09,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:52:09,260 INFO L85 PathProgramCache]: Analyzing trace with hash 175635572, now seen corresponding path program 1 times [2024-11-17 02:52:09,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:52:09,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [532114724] [2024-11-17 02:52:09,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:52:09,261 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-17 02:52:09,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:52:09,262 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-17 02:52:09,263 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-17 02:52:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:52:09,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 02:52:09,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:52:09,452 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-17 02:52:09,452 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:52:09,452 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:52:09,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [532114724] [2024-11-17 02:52:09,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [532114724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:52:09,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:52:09,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:52:09,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595707266] [2024-11-17 02:52:09,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:52:09,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:52:09,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:52:09,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:52:09,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:52:09,455 INFO L87 Difference]: Start difference. First operand 1488 states and 1798 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-17 02:52:09,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:52:09,479 INFO L93 Difference]: Finished difference Result 1428 states and 1712 transitions. [2024-11-17 02:52:09,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:52:09,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2024-11-17 02:52:09,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:52:09,483 INFO L225 Difference]: With dead ends: 1428 [2024-11-17 02:52:09,483 INFO L226 Difference]: Without dead ends: 1428 [2024-11-17 02:52:09,483 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-17 02:52:09,484 INFO L432 NwaCegarLoop]: 1216 mSDtfsCounter, 71 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2368 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:52:09,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2368 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:52:09,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2024-11-17 02:52:09,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2024-11-17 02:52:09,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 894 states have (on average 1.8702460850111857) internal successors, (1672), 1405 states have internal predecessors, (1672), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-17 02:52:09,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1712 transitions. [2024-11-17 02:52:09,504 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1712 transitions. Word has length 21 [2024-11-17 02:52:09,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:52:09,504 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 1712 transitions. [2024-11-17 02:52:09,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-17 02:52:09,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1712 transitions. [2024-11-17 02:52:09,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 02:52:09,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:52:09,507 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:52:09,514 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-17 02:52:09,707 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-17 02:52:09,708 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr575REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:52:09,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:52:09,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1282032712, now seen corresponding path program 1 times [2024-11-17 02:52:09,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:52:09,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193193544] [2024-11-17 02:52:09,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:52:09,713 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-17 02:52:09,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:52:09,715 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-17 02:52:09,718 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-17 02:52:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:52:09,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:52:09,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:52:09,926 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-17 02:52:09,926 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:52:09,926 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:52:09,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193193544] [2024-11-17 02:52:09,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [193193544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:52:09,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:52:09,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:52:09,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862331221] [2024-11-17 02:52:09,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:52:09,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:52:09,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:52:09,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:52:09,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:52:09,928 INFO L87 Difference]: Start difference. First operand 1428 states and 1712 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-17 02:52:09,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:52:09,984 INFO L93 Difference]: Finished difference Result 1398 states and 1654 transitions. [2024-11-17 02:52:09,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:52:09,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2024-11-17 02:52:09,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:52:09,987 INFO L225 Difference]: With dead ends: 1398 [2024-11-17 02:52:09,987 INFO L226 Difference]: Without dead ends: 1398 [2024-11-17 02:52:09,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 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-17 02:52:09,988 INFO L432 NwaCegarLoop]: 1171 mSDtfsCounter, 48 mSDsluCounter, 2315 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3486 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:52:09,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3486 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:52:09,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-11-17 02:52:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1398. [2024-11-17 02:52:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 878 states have (on average 1.8382687927107062) internal successors, (1614), 1375 states have internal predecessors, (1614), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-17 02:52:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 1654 transitions. [2024-11-17 02:52:10,005 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 1654 transitions. Word has length 23 [2024-11-17 02:52:10,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:52:10,005 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 1654 transitions. [2024-11-17 02:52:10,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-17 02:52:10,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1654 transitions. [2024-11-17 02:52:10,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 02:52:10,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:52:10,006 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:52:10,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-17 02:52:10,207 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-17 02:52:10,207 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr561REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:52:10,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:52:10,208 INFO L85 PathProgramCache]: Analyzing trace with hash 328806238, now seen corresponding path program 1 times [2024-11-17 02:52:10,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:52:10,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715703763] [2024-11-17 02:52:10,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:52:10,209 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-17 02:52:10,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:52:10,212 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-17 02:52:10,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-17 02:52:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:52:10,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 02:52:10,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:52:10,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:52:10,503 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-17 02:52:10,503 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:52:10,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:52:10,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715703763] [2024-11-17 02:52:10,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715703763] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:52:10,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:52:10,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:52:10,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868203355] [2024-11-17 02:52:10,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:52:10,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:52:10,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:52:10,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:52:10,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:52:10,505 INFO L87 Difference]: Start difference. First operand 1398 states and 1654 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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-17 02:52:12,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:52:12,484 INFO L93 Difference]: Finished difference Result 1839 states and 2216 transitions. [2024-11-17 02:52:12,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:52:12,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2024-11-17 02:52:12,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:52:12,490 INFO L225 Difference]: With dead ends: 1839 [2024-11-17 02:52:12,490 INFO L226 Difference]: Without dead ends: 1839 [2024-11-17 02:52:12,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 02:52:12,491 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 836 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 1891 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 1899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-17 02:52:12,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 2391 Invalid, 1899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1891 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-17 02:52:12,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2024-11-17 02:52:12,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1394. [2024-11-17 02:52:12,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 878 states have (on average 1.8291571753986333) internal successors, (1606), 1371 states have internal predecessors, (1606), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-17 02:52:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1646 transitions. [2024-11-17 02:52:12,508 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1646 transitions. Word has length 37 [2024-11-17 02:52:12,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:52:12,509 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1646 transitions. [2024-11-17 02:52:12,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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-17 02:52:12,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1646 transitions. [2024-11-17 02:52:12,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 02:52:12,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:52:12,510 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:52:12,517 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-17 02:52:12,710 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-17 02:52:12,711 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr562REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:52:12,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:52:12,712 INFO L85 PathProgramCache]: Analyzing trace with hash 328806239, now seen corresponding path program 1 times [2024-11-17 02:52:12,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:52:12,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [505730954] [2024-11-17 02:52:12,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:52:12,713 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-17 02:52:12,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:52:12,716 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-17 02:52:12,717 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-17 02:52:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:52:12,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 02:52:12,932 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:52:12,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:52:13,100 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-17 02:52:13,100 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:52:13,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:52:13,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [505730954] [2024-11-17 02:52:13,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [505730954] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:52:13,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:52:13,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:52:13,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065085682] [2024-11-17 02:52:13,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:52:13,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:52:13,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:52:13,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:52:13,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:52:13,101 INFO L87 Difference]: Start difference. First operand 1394 states and 1646 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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-17 02:52:15,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:52:15,800 INFO L93 Difference]: Finished difference Result 1965 states and 2344 transitions. [2024-11-17 02:52:15,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:52:15,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2024-11-17 02:52:15,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:52:15,806 INFO L225 Difference]: With dead ends: 1965 [2024-11-17 02:52:15,806 INFO L226 Difference]: Without dead ends: 1965 [2024-11-17 02:52:15,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-17 02:52:15,807 INFO L432 NwaCegarLoop]: 1432 mSDtfsCounter, 609 mSDsluCounter, 2383 mSDsCounter, 0 mSdLazyCounter, 2295 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 3815 SdHoareTripleChecker+Invalid, 2299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:52:15,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 3815 Invalid, 2299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2295 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-17 02:52:15,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2024-11-17 02:52:15,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1390. [2024-11-17 02:52:15,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 878 states have (on average 1.8200455580865604) internal successors, (1598), 1367 states have internal predecessors, (1598), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-17 02:52:15,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1638 transitions. [2024-11-17 02:52:15,833 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1638 transitions. Word has length 37 [2024-11-17 02:52:15,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:52:15,834 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 1638 transitions. [2024-11-17 02:52:15,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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-17 02:52:15,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1638 transitions. [2024-11-17 02:52:15,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-17 02:52:15,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:52:15,835 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:52:15,841 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-17 02:52:16,035 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-17 02:52:16,036 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:52:16,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:52:16,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1735593719, now seen corresponding path program 1 times [2024-11-17 02:52:16,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:52:16,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [840346230] [2024-11-17 02:52:16,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:52:16,037 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-17 02:52:16,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:52:16,040 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-17 02:52:16,041 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-17 02:52:16,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:52:16,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:52:16,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:52:16,332 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-17 02:52:16,332 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:52:16,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:52:16,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [840346230] [2024-11-17 02:52:16,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [840346230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:52:16,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:52:16,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:52:16,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504790727] [2024-11-17 02:52:16,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:52:16,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:52:16,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:52:16,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:52:16,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:52:16,334 INFO L87 Difference]: Start difference. First operand 1390 states and 1638 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:52:16,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:52:16,393 INFO L93 Difference]: Finished difference Result 1378 states and 1618 transitions. [2024-11-17 02:52:16,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:52:16,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2024-11-17 02:52:16,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:52:16,404 INFO L225 Difference]: With dead ends: 1378 [2024-11-17 02:52:16,404 INFO L226 Difference]: Without dead ends: 1378 [2024-11-17 02:52:16,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 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-17 02:52:16,405 INFO L432 NwaCegarLoop]: 1165 mSDtfsCounter, 21 mSDsluCounter, 2298 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3463 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:52:16,406 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3463 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:52:16,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2024-11-17 02:52:16,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1378. [2024-11-17 02:52:16,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 866 states have (on average 1.8221709006928406) internal successors, (1578), 1355 states have internal predecessors, (1578), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-17 02:52:16,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1618 transitions. [2024-11-17 02:52:16,422 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1618 transitions. Word has length 59 [2024-11-17 02:52:16,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:52:16,422 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 1618 transitions. [2024-11-17 02:52:16,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:52:16,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1618 transitions. [2024-11-17 02:52:16,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-17 02:52:16,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:52:16,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:52:16,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-17 02:52:16,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:52:16,627 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:52:16,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:52:16,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1413574463, now seen corresponding path program 1 times [2024-11-17 02:52:16,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:52:16,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320348702] [2024-11-17 02:52:16,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:52:16,629 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-17 02:52:16,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:52:16,632 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:52:16,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-17 02:52:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:52:16,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-17 02:52:16,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:52:17,025 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-17 02:52:17,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2024-11-17 02:52:17,105 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-17 02:52:17,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2024-11-17 02:52:17,537 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-17 02:52:17,537 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:52:17,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:52:17,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320348702] [2024-11-17 02:52:17,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320348702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:52:17,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:52:17,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:52:17,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694962740] [2024-11-17 02:52:17,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:52:17,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 02:52:17,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:52:17,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 02:52:17,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:52:17,540 INFO L87 Difference]: Start difference. First operand 1378 states and 1618 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:52:21,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:52:21,046 INFO L93 Difference]: Finished difference Result 2522 states and 2958 transitions. [2024-11-17 02:52:21,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:52:21,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-17 02:52:21,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:52:21,051 INFO L225 Difference]: With dead ends: 2522 [2024-11-17 02:52:21,051 INFO L226 Difference]: Without dead ends: 2522 [2024-11-17 02:52:21,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-17 02:52:21,052 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 1016 mSDsluCounter, 2727 mSDsCounter, 0 mSdLazyCounter, 2669 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 3652 SdHoareTripleChecker+Invalid, 2673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:52:21,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 3652 Invalid, 2673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2669 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-17 02:52:21,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2024-11-17 02:52:21,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 1850. [2024-11-17 02:52:21,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850 states, 1322 states have (on average 1.8055975794251136) internal successors, (2387), 1814 states have internal predecessors, (2387), 35 states have call successors, (35), 9 states have call predecessors, (35), 7 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-17 02:52:21,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2453 transitions. [2024-11-17 02:52:21,078 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2453 transitions. Word has length 67 [2024-11-17 02:52:21,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:52:21,078 INFO L471 AbstractCegarLoop]: Abstraction has 1850 states and 2453 transitions. [2024-11-17 02:52:21,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:52:21,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2453 transitions. [2024-11-17 02:52:21,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-17 02:52:21,079 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:52:21,080 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:52:21,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-17 02:52:21,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:52:21,280 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:52:21,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:52:21,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1413574464, now seen corresponding path program 1 times [2024-11-17 02:52:21,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:52:21,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348911975] [2024-11-17 02:52:21,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:52:21,281 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-17 02:52:21,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:52:21,283 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:52:21,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-17 02:52:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:52:21,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-17 02:52:21,650 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:52:21,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 02:52:21,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 02:52:21,758 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-17 02:52:21,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-17 02:52:22,433 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-17 02:52:22,433 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:52:22,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:52:22,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348911975] [2024-11-17 02:52:22,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348911975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:52:22,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:52:22,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:52:22,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594315013] [2024-11-17 02:52:22,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:52:22,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 02:52:22,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:52:22,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 02:52:22,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:52:22,435 INFO L87 Difference]: Start difference. First operand 1850 states and 2453 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:52:24,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:52:24,862 INFO L93 Difference]: Finished difference Result 1856 states and 2460 transitions. [2024-11-17 02:52:24,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:52:24,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-11-17 02:52:24,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:52:24,865 INFO L225 Difference]: With dead ends: 1856 [2024-11-17 02:52:24,865 INFO L226 Difference]: Without dead ends: 1856 [2024-11-17 02:52:24,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-17 02:52:24,866 INFO L432 NwaCegarLoop]: 1160 mSDtfsCounter, 62 mSDsluCounter, 1904 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 3064 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:52:24,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 3064 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-17 02:52:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2024-11-17 02:52:24,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1856. [2024-11-17 02:52:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1327 states have (on average 1.8025621703089676) internal successors, (2392), 1819 states have internal predecessors, (2392), 36 states have call successors, (36), 10 states have call predecessors, (36), 7 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-17 02:52:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 2460 transitions. [2024-11-17 02:52:24,886 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 2460 transitions. Word has length 67 [2024-11-17 02:52:24,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:52:24,887 INFO L471 AbstractCegarLoop]: Abstraction has 1856 states and 2460 transitions. [2024-11-17 02:52:24,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:52:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2460 transitions. [2024-11-17 02:52:24,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-17 02:52:24,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:52:24,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:52:24,900 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 (16)] Forceful destruction successful, exit code 0 [2024-11-17 02:52:25,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:52:25,088 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:52:25,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:52:25,089 INFO L85 PathProgramCache]: Analyzing trace with hash -481187710, now seen corresponding path program 1 times [2024-11-17 02:52:25,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:52:25,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015367921] [2024-11-17 02:52:25,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:52:25,090 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-17 02:52:25,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:52:25,091 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:52:25,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-17 02:52:25,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:52:25,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 02:52:25,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:52:25,395 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-17 02:52:25,395 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:52:25,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:52:25,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015367921] [2024-11-17 02:52:25,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015367921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:52:25,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:52:25,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 02:52:25,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736021886] [2024-11-17 02:52:25,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:52:25,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 02:52:25,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:52:25,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 02:52:25,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:52:25,397 INFO L87 Difference]: Start difference. First operand 1856 states and 2460 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:52:25,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:52:25,495 INFO L93 Difference]: Finished difference Result 1882 states and 2487 transitions. [2024-11-17 02:52:25,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:52:25,495 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-17 02:52:25,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:52:25,500 INFO L225 Difference]: With dead ends: 1882 [2024-11-17 02:52:25,500 INFO L226 Difference]: Without dead ends: 1882 [2024-11-17 02:52:25,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-17 02:52:25,501 INFO L432 NwaCegarLoop]: 1175 mSDtfsCounter, 15 mSDsluCounter, 4695 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 5870 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:52:25,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 5870 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:52:25,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2024-11-17 02:52:25,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1880. [2024-11-17 02:52:25,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1345 states have (on average 1.795539033457249) internal successors, (2415), 1839 states have internal predecessors, (2415), 38 states have call successors, (38), 14 states have call predecessors, (38), 11 states have return successors, (34), 30 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-17 02:52:25,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2487 transitions. [2024-11-17 02:52:25,533 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2487 transitions. Word has length 75 [2024-11-17 02:52:25,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:52:25,533 INFO L471 AbstractCegarLoop]: Abstraction has 1880 states and 2487 transitions. [2024-11-17 02:52:25,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:52:25,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2487 transitions. [2024-11-17 02:52:25,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-17 02:52:25,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:52:25,535 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:52:25,544 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 (17)] Ended with exit code 0 [2024-11-17 02:52:25,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-17 02:52:25,735 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr517REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:52:25,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:52:25,736 INFO L85 PathProgramCache]: Analyzing trace with hash 344424323, now seen corresponding path program 1 times [2024-11-17 02:52:25,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:52:25,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442701830] [2024-11-17 02:52:25,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:52:25,737 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-17 02:52:25,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:52:25,741 INFO L229 MonitoredProcess]: Starting monitored process 18 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-17 02:52:25,741 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 (18)] Waiting until timeout for monitored process [2024-11-17 02:52:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:52:26,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 02:52:26,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:52:26,149 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-17 02:52:26,149 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:52:26,150 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:52:26,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442701830] [2024-11-17 02:52:26,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442701830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:52:26,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:52:26,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 02:52:26,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309707758] [2024-11-17 02:52:26,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:52:26,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 02:52:26,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:52:26,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 02:52:26,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:52:26,152 INFO L87 Difference]: Start difference. First operand 1880 states and 2487 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:52:26,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:52:26,416 INFO L93 Difference]: Finished difference Result 1892 states and 2501 transitions. [2024-11-17 02:52:26,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 02:52:26,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 73 [2024-11-17 02:52:26,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:52:26,423 INFO L225 Difference]: With dead ends: 1892 [2024-11-17 02:52:26,423 INFO L226 Difference]: Without dead ends: 1892 [2024-11-17 02:52:26,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-17 02:52:26,424 INFO L432 NwaCegarLoop]: 1158 mSDtfsCounter, 23 mSDsluCounter, 4532 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 5690 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:52:26,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 5690 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 02:52:26,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2024-11-17 02:52:26,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1883. [2024-11-17 02:52:26,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1883 states, 1347 states have (on average 1.7943578322197475) internal successors, (2417), 1841 states have internal predecessors, (2417), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-17 02:52:26,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 2490 transitions. [2024-11-17 02:52:26,464 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 2490 transitions. Word has length 73 [2024-11-17 02:52:26,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:52:26,464 INFO L471 AbstractCegarLoop]: Abstraction has 1883 states and 2490 transitions. [2024-11-17 02:52:26,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-17 02:52:26,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 2490 transitions. [2024-11-17 02:52:26,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-17 02:52:26,468 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:52:26,468 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:52:26,479 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 (18)] Ended with exit code 0 [2024-11-17 02:52:26,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-17 02:52:26,670 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr517REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:52:26,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:52:26,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1635836253, now seen corresponding path program 1 times [2024-11-17 02:52:26,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:52:26,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928470293] [2024-11-17 02:52:26,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:52:26,671 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-17 02:52:26,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:52:26,675 INFO L229 MonitoredProcess]: Starting monitored process 19 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-17 02:52:26,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-17 02:52:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:52:27,105 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 02:52:27,109 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:52:27,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:52:27,230 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#valid)| |alt_malloc_#res.base| (_ bv1 1)) |c_#valid|)) is different from true [2024-11-17 02:52:27,242 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-17 02:52:27,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-17 02:52:27,250 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-17 02:52:27,250 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:52:27,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:52:27,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928470293] [2024-11-17 02:52:27,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928470293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:52:27,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:52:27,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 02:52:27,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425349617] [2024-11-17 02:52:27,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:52:27,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 02:52:27,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:52:27,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 02:52:27,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-11-17 02:52:27,252 INFO L87 Difference]: Start difference. First operand 1883 states and 2490 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:52:29,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:52:29,728 INFO L93 Difference]: Finished difference Result 2319 states and 3050 transitions. [2024-11-17 02:52:29,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-17 02:52:29,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 78 [2024-11-17 02:52:29,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:52:29,733 INFO L225 Difference]: With dead ends: 2319 [2024-11-17 02:52:29,733 INFO L226 Difference]: Without dead ends: 2319 [2024-11-17 02:52:29,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2024-11-17 02:52:29,734 INFO L432 NwaCegarLoop]: 738 mSDtfsCounter, 792 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 2284 SdHoareTripleChecker+Invalid, 3538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1581 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:52:29,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 2284 Invalid, 3538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1934 Invalid, 0 Unknown, 1581 Unchecked, 2.4s Time] [2024-11-17 02:52:29,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2024-11-17 02:52:29,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 1882. [2024-11-17 02:52:29,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1347 states have (on average 1.7928730512249442) internal successors, (2415), 1840 states have internal predecessors, (2415), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-17 02:52:29,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2488 transitions. [2024-11-17 02:52:29,760 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2488 transitions. Word has length 78 [2024-11-17 02:52:29,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:52:29,760 INFO L471 AbstractCegarLoop]: Abstraction has 1882 states and 2488 transitions. [2024-11-17 02:52:29,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:52:29,760 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2488 transitions. [2024-11-17 02:52:29,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-17 02:52:29,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:52:29,761 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:52:29,775 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 (19)] Ended with exit code 0 [2024-11-17 02:52:29,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-17 02:52:29,962 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr518REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:52:29,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:52:29,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1635836252, now seen corresponding path program 1 times [2024-11-17 02:52:29,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:52:29,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1835407889] [2024-11-17 02:52:29,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:52:29,963 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-17 02:52:29,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:52:29,967 INFO L229 MonitoredProcess]: Starting monitored process 20 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-17 02:52:29,968 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 (20)] Waiting until timeout for monitored process [2024-11-17 02:52:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:52:30,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-17 02:52:30,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:52:30,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:52:30,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:52:30,946 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |alt_malloc_#res.base| (select |c_#length| |alt_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |alt_malloc_#res.base|)))) is different from true [2024-11-17 02:52:30,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 02:52:30,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-17 02:52:30,981 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 02:52:30,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-17 02:52:31,010 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-17 02:52:31,010 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:52:31,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:52:31,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1835407889] [2024-11-17 02:52:31,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1835407889] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:52:31,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:52:31,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 02:52:31,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729114697] [2024-11-17 02:52:31,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:52:31,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 02:52:31,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:52:31,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 02:52:31,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2024-11-17 02:52:31,012 INFO L87 Difference]: Start difference. First operand 1882 states and 2488 transitions. Second operand has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:52:35,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:52:35,429 INFO L93 Difference]: Finished difference Result 3022 states and 3986 transitions. [2024-11-17 02:52:35,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 02:52:35,429 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 78 [2024-11-17 02:52:35,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:52:35,433 INFO L225 Difference]: With dead ends: 3022 [2024-11-17 02:52:35,433 INFO L226 Difference]: Without dead ends: 3022 [2024-11-17 02:52:35,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-11-17 02:52:35,434 INFO L432 NwaCegarLoop]: 1248 mSDtfsCounter, 975 mSDsluCounter, 2056 mSDsCounter, 0 mSdLazyCounter, 4127 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 3304 SdHoareTripleChecker+Invalid, 6233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 4127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2079 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-17 02:52:35,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 3304 Invalid, 6233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 4127 Invalid, 0 Unknown, 2079 Unchecked, 4.3s Time] [2024-11-17 02:52:35,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2024-11-17 02:52:35,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 1874. [2024-11-17 02:52:35,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1874 states, 1347 states have (on average 1.7809948032665182) internal successors, (2399), 1832 states have internal predecessors, (2399), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-17 02:52:35,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2472 transitions. [2024-11-17 02:52:35,458 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2472 transitions. Word has length 78 [2024-11-17 02:52:35,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:52:35,458 INFO L471 AbstractCegarLoop]: Abstraction has 1874 states and 2472 transitions. [2024-11-17 02:52:35,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:52:35,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2472 transitions. [2024-11-17 02:52:35,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-17 02:52:35,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:52:35,459 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:52:35,471 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 (20)] Ended with exit code 0 [2024-11-17 02:52:35,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-17 02:52:35,660 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:52:35,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:52:35,661 INFO L85 PathProgramCache]: Analyzing trace with hash -276349187, now seen corresponding path program 1 times [2024-11-17 02:52:35,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:52:35,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [60118528] [2024-11-17 02:52:35,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:52:35,661 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-17 02:52:35,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:52:35,663 INFO L229 MonitoredProcess]: Starting monitored process 21 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-17 02:52:35,664 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 (21)] Waiting until timeout for monitored process [2024-11-17 02:52:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:52:35,985 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 02:52:35,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:52:35,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:52:36,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:52:36,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-17 02:52:36,078 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-17 02:52:36,079 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:52:36,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:52:36,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [60118528] [2024-11-17 02:52:36,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [60118528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:52:36,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:52:36,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 02:52:36,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434519247] [2024-11-17 02:52:36,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:52:36,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 02:52:36,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:52:36,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 02:52:36,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-17 02:52:36,081 INFO L87 Difference]: Start difference. First operand 1874 states and 2472 transitions. Second operand has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:52:38,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:52:38,876 INFO L93 Difference]: Finished difference Result 1891 states and 2490 transitions. [2024-11-17 02:52:38,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 02:52:38,877 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 85 [2024-11-17 02:52:38,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:52:38,880 INFO L225 Difference]: With dead ends: 1891 [2024-11-17 02:52:38,880 INFO L226 Difference]: Without dead ends: 1891 [2024-11-17 02:52:38,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-17 02:52:38,881 INFO L432 NwaCegarLoop]: 1161 mSDtfsCounter, 19 mSDsluCounter, 3888 mSDsCounter, 0 mSdLazyCounter, 3139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 5049 SdHoareTripleChecker+Invalid, 3141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:52:38,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 5049 Invalid, 3141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3139 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-17 02:52:38,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2024-11-17 02:52:38,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1890. [2024-11-17 02:52:38,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1361 states have (on average 1.7759000734753858) internal successors, (2417), 1846 states have internal predecessors, (2417), 38 states have call successors, (38), 16 states have call predecessors, (38), 14 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-17 02:52:38,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2490 transitions. [2024-11-17 02:52:38,901 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2490 transitions. Word has length 85 [2024-11-17 02:52:38,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:52:38,901 INFO L471 AbstractCegarLoop]: Abstraction has 1890 states and 2490 transitions. [2024-11-17 02:52:38,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:52:38,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2490 transitions. [2024-11-17 02:52:38,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-17 02:52:38,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:52:38,903 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:52:38,914 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 (21)] Ended with exit code 0 [2024-11-17 02:52:39,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-17 02:52:39,104 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:52:39,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:52:39,104 INFO L85 PathProgramCache]: Analyzing trace with hash 23109801, now seen corresponding path program 1 times [2024-11-17 02:52:39,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:52:39,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [28367765] [2024-11-17 02:52:39,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:52:39,105 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-17 02:52:39,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:52:39,108 INFO L229 MonitoredProcess]: Starting monitored process 22 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-17 02:52:39,110 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 (22)] Waiting until timeout for monitored process [2024-11-17 02:52:39,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:52:39,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-17 02:52:39,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:52:39,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-17 02:52:39,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:52:39,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 02:52:39,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-17 02:52:39,618 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-17 02:52:39,619 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:52:39,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:52:39,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [28367765] [2024-11-17 02:52:39,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [28367765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:52:39,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:52:39,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-17 02:52:39,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137641451] [2024-11-17 02:52:39,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:52:39,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-17 02:52:39,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:52:39,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-17 02:52:39,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-17 02:52:39,620 INFO L87 Difference]: Start difference. First operand 1890 states and 2490 transitions. Second operand has 9 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:52:43,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:52:43,133 INFO L93 Difference]: Finished difference Result 1890 states and 2488 transitions. [2024-11-17 02:52:43,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 02:52:43,133 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2024-11-17 02:52:43,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:52:43,136 INFO L225 Difference]: With dead ends: 1890 [2024-11-17 02:52:43,136 INFO L226 Difference]: Without dead ends: 1890 [2024-11-17 02:52:43,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-17 02:52:43,137 INFO L432 NwaCegarLoop]: 1157 mSDtfsCounter, 15 mSDsluCounter, 4913 mSDsCounter, 0 mSdLazyCounter, 3287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 6070 SdHoareTripleChecker+Invalid, 3288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:52:43,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 6070 Invalid, 3288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3287 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-17 02:52:43,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2024-11-17 02:52:43,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1890. [2024-11-17 02:52:43,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1361 states have (on average 1.7744305657604702) internal successors, (2415), 1846 states have internal predecessors, (2415), 38 states have call successors, (38), 16 states have call predecessors, (38), 14 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-17 02:52:43,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2488 transitions. [2024-11-17 02:52:43,159 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2488 transitions. Word has length 86 [2024-11-17 02:52:43,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:52:43,159 INFO L471 AbstractCegarLoop]: Abstraction has 1890 states and 2488 transitions. [2024-11-17 02:52:43,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-17 02:52:43,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2488 transitions. [2024-11-17 02:52:43,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-17 02:52:43,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:52:43,161 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:52:43,172 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 (22)] Forceful destruction successful, exit code 0 [2024-11-17 02:52:43,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-17 02:52:43,362 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr509REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:52:43,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:52:43,363 INFO L85 PathProgramCache]: Analyzing trace with hash 698278914, now seen corresponding path program 1 times [2024-11-17 02:52:43,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:52:43,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289142537] [2024-11-17 02:52:43,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:52:43,364 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-17 02:52:43,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:52:43,367 INFO L229 MonitoredProcess]: Starting monitored process 23 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-17 02:52:43,368 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 (23)] Waiting until timeout for monitored process [2024-11-17 02:52:43,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:52:43,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 02:52:43,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:52:43,749 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-17 02:52:43,749 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:52:43,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:52:43,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [289142537] [2024-11-17 02:52:43,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [289142537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:52:43,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:52:43,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-17 02:52:43,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139194823] [2024-11-17 02:52:43,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:52:43,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:52:43,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:52:43,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:52:43,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:52:43,751 INFO L87 Difference]: Start difference. First operand 1890 states and 2488 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 02:52:43,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:52:43,800 INFO L93 Difference]: Finished difference Result 1906 states and 2506 transitions. [2024-11-17 02:52:43,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:52:43,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 94 [2024-11-17 02:52:43,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:52:43,804 INFO L225 Difference]: With dead ends: 1906 [2024-11-17 02:52:43,804 INFO L226 Difference]: Without dead ends: 1900 [2024-11-17 02:52:43,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:52:43,804 INFO L432 NwaCegarLoop]: 1166 mSDtfsCounter, 3 mSDsluCounter, 2323 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3489 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:52:43,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3489 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:52:43,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1900 states. [2024-11-17 02:52:43,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 1900. [2024-11-17 02:52:43,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1900 states, 1369 states have (on average 1.7713659605551497) internal successors, (2425), 1856 states have internal predecessors, (2425), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2024-11-17 02:52:43,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 2500 transitions. [2024-11-17 02:52:43,824 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 2500 transitions. Word has length 94 [2024-11-17 02:52:43,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:52:43,824 INFO L471 AbstractCegarLoop]: Abstraction has 1900 states and 2500 transitions. [2024-11-17 02:52:43,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 02:52:43,824 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2500 transitions. [2024-11-17 02:52:43,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-17 02:52:43,825 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:52:43,825 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:52:43,836 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 (23)] Forceful destruction successful, exit code 0 [2024-11-17 02:52:44,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-17 02:52:44,026 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr509REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:52:44,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:52:44,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1391207657, now seen corresponding path program 1 times [2024-11-17 02:52:44,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:52:44,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402188685] [2024-11-17 02:52:44,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:52:44,027 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-17 02:52:44,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:52:44,029 INFO L229 MonitoredProcess]: Starting monitored process 24 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-17 02:52:44,030 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 (24)] Waiting until timeout for monitored process [2024-11-17 02:52:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:52:44,366 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 02:52:44,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:52:44,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:52:44,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:52:44,512 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:52:44,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:52:44,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402188685] [2024-11-17 02:52:44,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402188685] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:52:44,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:52:44,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-17 02:52:44,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851412191] [2024-11-17 02:52:44,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:52:44,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-17 02:52:44,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:52:44,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-17 02:52:44,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-17 02:52:44,515 INFO L87 Difference]: Start difference. First operand 1900 states and 2500 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-17 02:52:44,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:52:44,678 INFO L93 Difference]: Finished difference Result 1926 states and 2530 transitions. [2024-11-17 02:52:44,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 02:52:44,679 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 95 [2024-11-17 02:52:44,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:52:44,682 INFO L225 Difference]: With dead ends: 1926 [2024-11-17 02:52:44,682 INFO L226 Difference]: Without dead ends: 1914 [2024-11-17 02:52:44,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-11-17 02:52:44,683 INFO L432 NwaCegarLoop]: 1166 mSDtfsCounter, 19 mSDsluCounter, 5804 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 6970 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:52:44,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 6970 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:52:44,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2024-11-17 02:52:44,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1908. [2024-11-17 02:52:44,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1908 states, 1377 states have (on average 1.768336964415396) internal successors, (2435), 1864 states have internal predecessors, (2435), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2024-11-17 02:52:44,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 2510 transitions. [2024-11-17 02:52:44,704 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 2510 transitions. Word has length 95 [2024-11-17 02:52:44,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:52:44,704 INFO L471 AbstractCegarLoop]: Abstraction has 1908 states and 2510 transitions. [2024-11-17 02:52:44,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-17 02:52:44,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2510 transitions. [2024-11-17 02:52:44,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-17 02:52:44,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:52:44,705 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:52:44,716 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 (24)] Ended with exit code 0 [2024-11-17 02:52:44,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-17 02:52:44,907 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr509REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:52:44,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:52:44,907 INFO L85 PathProgramCache]: Analyzing trace with hash -626097854, now seen corresponding path program 2 times [2024-11-17 02:52:44,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:52:44,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042433841] [2024-11-17 02:52:44,908 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 02:52:44,908 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-17 02:52:44,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:52:44,911 INFO L229 MonitoredProcess]: Starting monitored process 25 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-17 02:52:44,912 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 (25)] Waiting until timeout for monitored process [2024-11-17 02:52:45,639 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 02:52:45,640 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:52:45,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 02:52:45,657 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:52:45,740 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:52:45,741 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:52:45,934 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:52:45,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:52:45,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042433841] [2024-11-17 02:52:45,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042433841] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:52:45,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:52:45,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-17 02:52:45,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239659536] [2024-11-17 02:52:45,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:52:45,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-17 02:52:45,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:52:45,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-17 02:52:45,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-17 02:52:45,937 INFO L87 Difference]: Start difference. First operand 1908 states and 2510 transitions. Second operand has 16 states, 16 states have (on average 6.4375) internal successors, (103), 16 states have internal predecessors, (103), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-17 02:52:46,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:52:46,400 INFO L93 Difference]: Finished difference Result 1944 states and 2560 transitions. [2024-11-17 02:52:46,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-17 02:52:46,401 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.4375) internal successors, (103), 16 states have internal predecessors, (103), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 98 [2024-11-17 02:52:46,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:52:46,405 INFO L225 Difference]: With dead ends: 1944 [2024-11-17 02:52:46,406 INFO L226 Difference]: Without dead ends: 1932 [2024-11-17 02:52:46,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2024-11-17 02:52:46,407 INFO L432 NwaCegarLoop]: 1166 mSDtfsCounter, 29 mSDsluCounter, 10442 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 11608 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:52:46,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 11608 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 02:52:46,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2024-11-17 02:52:46,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1926. [2024-11-17 02:52:46,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1395 states have (on average 1.7627240143369176) internal successors, (2459), 1882 states have internal predecessors, (2459), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2024-11-17 02:52:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2534 transitions. [2024-11-17 02:52:46,431 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2534 transitions. Word has length 98 [2024-11-17 02:52:46,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:52:46,431 INFO L471 AbstractCegarLoop]: Abstraction has 1926 states and 2534 transitions. [2024-11-17 02:52:46,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.4375) internal successors, (103), 16 states have internal predecessors, (103), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-17 02:52:46,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2534 transitions. [2024-11-17 02:52:46,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-17 02:52:46,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:52:46,433 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:52:46,448 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 (25)] Ended with exit code 0 [2024-11-17 02:52:46,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-17 02:52:46,634 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr509REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:52:46,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:52:46,634 INFO L85 PathProgramCache]: Analyzing trace with hash 428851490, now seen corresponding path program 3 times [2024-11-17 02:52:46,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:52:46,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1782482158] [2024-11-17 02:52:46,635 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 02:52:46,636 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-17 02:52:46,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:52:46,639 INFO L229 MonitoredProcess]: Starting monitored process 26 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-17 02:52:46,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-17 02:52:47,628 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-17 02:52:47,628 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:52:47,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-17 02:52:47,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:52:47,840 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:52:47,840 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:52:48,398 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:52:48,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:52:48,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1782482158] [2024-11-17 02:52:48,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1782482158] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:52:48,399 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:52:48,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-11-17 02:52:48,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593882459] [2024-11-17 02:52:48,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:52:48,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-17 02:52:48,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:52:48,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-17 02:52:48,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2024-11-17 02:52:48,401 INFO L87 Difference]: Start difference. First operand 1926 states and 2534 transitions. Second operand has 28 states, 28 states have (on average 4.107142857142857) internal successors, (115), 28 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-17 02:52:50,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:52:50,312 INFO L93 Difference]: Finished difference Result 1980 states and 2618 transitions. [2024-11-17 02:52:50,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-17 02:52:50,313 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.107142857142857) internal successors, (115), 28 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 104 [2024-11-17 02:52:50,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:52:50,317 INFO L225 Difference]: With dead ends: 1980 [2024-11-17 02:52:50,318 INFO L226 Difference]: Without dead ends: 1962 [2024-11-17 02:52:50,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=854, Invalid=1696, Unknown=0, NotChecked=0, Total=2550 [2024-11-17 02:52:50,319 INFO L432 NwaCegarLoop]: 1166 mSDtfsCounter, 60 mSDsluCounter, 16255 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 17421 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:52:50,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 17421 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 02:52:50,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2024-11-17 02:52:50,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2024-11-17 02:52:50,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1431 states have (on average 1.750524109014675) internal successors, (2505), 1918 states have internal predecessors, (2505), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2024-11-17 02:52:50,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2580 transitions. [2024-11-17 02:52:50,347 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2580 transitions. Word has length 104 [2024-11-17 02:52:50,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:52:50,347 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2580 transitions. [2024-11-17 02:52:50,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.107142857142857) internal successors, (115), 28 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-17 02:52:50,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2580 transitions. [2024-11-17 02:52:50,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-17 02:52:50,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:52:50,350 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:52:50,366 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 (26)] Ended with exit code 0 [2024-11-17 02:52:50,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-17 02:52:50,551 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr509REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:52:50,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:52:50,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1000732446, now seen corresponding path program 4 times [2024-11-17 02:52:50,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:52:50,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2045735622] [2024-11-17 02:52:50,553 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 02:52:50,553 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-17 02:52:50,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:52:50,556 INFO L229 MonitoredProcess]: Starting monitored process 27 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-17 02:52:50,559 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 (27)] Waiting until timeout for monitored process [2024-11-17 02:52:51,341 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 02:52:51,342 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:52:51,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-17 02:52:51,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:52:51,970 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:52:51,970 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:52:53,285 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:52:53,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:52:53,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2045735622] [2024-11-17 02:52:53,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2045735622] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:52:53,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:52:53,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-17 02:52:53,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705308341] [2024-11-17 02:52:53,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:52:53,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-17 02:52:53,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:52:53,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-17 02:52:53,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2024-11-17 02:52:53,288 INFO L87 Difference]: Start difference. First operand 1962 states and 2580 transitions. Second operand has 52 states, 52 states have (on average 2.673076923076923) internal successors, (139), 52 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-17 02:53:01,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:53:01,518 INFO L93 Difference]: Finished difference Result 2048 states and 2730 transitions. [2024-11-17 02:53:01,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-17 02:53:01,520 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.673076923076923) internal successors, (139), 52 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 116 [2024-11-17 02:53:01,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:53:01,524 INFO L225 Difference]: With dead ends: 2048 [2024-11-17 02:53:01,524 INFO L226 Difference]: Without dead ends: 2036 [2024-11-17 02:53:01,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=2955, Invalid=6357, Unknown=0, NotChecked=0, Total=9312 [2024-11-17 02:53:01,526 INFO L432 NwaCegarLoop]: 1166 mSDtfsCounter, 151 mSDsluCounter, 27879 mSDsCounter, 0 mSdLazyCounter, 1816 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 29045 SdHoareTripleChecker+Invalid, 1899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-17 02:53:01,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 29045 Invalid, 1899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1816 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-17 02:53:01,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2024-11-17 02:53:01,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 2030. [2024-11-17 02:53:01,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2030 states, 1499 states have (on average 1.732488325550367) internal successors, (2597), 1986 states have internal predecessors, (2597), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2024-11-17 02:53:01,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 2672 transitions. [2024-11-17 02:53:01,552 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 2672 transitions. Word has length 116 [2024-11-17 02:53:01,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:53:01,553 INFO L471 AbstractCegarLoop]: Abstraction has 2030 states and 2672 transitions. [2024-11-17 02:53:01,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.673076923076923) internal successors, (139), 52 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-17 02:53:01,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 2672 transitions. [2024-11-17 02:53:01,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-17 02:53:01,554 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:01,554 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:53:01,572 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 (27)] Ended with exit code 0 [2024-11-17 02:53:01,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -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-17 02:53:01,759 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr509REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-17 02:53:01,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:01,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1245166142, now seen corresponding path program 5 times [2024-11-17 02:53:01,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:01,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100560116] [2024-11-17 02:53:01,761 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 02:53:01,761 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-17 02:53:01,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:01,764 INFO L229 MonitoredProcess]: Starting monitored process 28 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-17 02:53:01,765 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 (28)] Waiting until timeout for monitored process