./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4a058bd9944921e52018f99044f11f694f824f3f09daf510330544b4558ba193 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:31:04,510 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:31:04,557 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-14 17:31:04,560 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:31:04,560 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:31:04,575 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:31:04,575 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:31:04,576 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:31:04,576 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:31:04,577 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:31:04,577 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:31:04,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:31:04,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:31:04,578 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:31:04,578 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:31:04,578 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:31:04,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:31:04,579 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:31:04,579 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:31:04,579 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:31:04,579 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:31:04,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:31:04,580 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:31:04,580 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:31:04,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:31:04,581 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:31:04,581 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:31:04,581 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:31:04,582 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:31:04,582 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:31:04,582 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:31:04,582 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:31:04,583 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:31:04,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:31:04,583 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:31:04,583 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:31:04,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:31:04,584 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:31:04,584 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:31:04,584 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:31:04,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:31:04,585 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:31:04,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:31:04,585 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:31:04,585 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:31:04,585 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4a058bd9944921e52018f99044f11f694f824f3f09daf510330544b4558ba193 [2024-10-14 17:31:04,765 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:31:04,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:31:04,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:31:04,781 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:31:04,781 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:31:04,782 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i [2024-10-14 17:31:06,088 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:31:06,309 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:31:06,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i [2024-10-14 17:31:06,334 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86af9e95/12daaa82cbcc4ef2b34230e6ca1f1850/FLAG2b236caaa [2024-10-14 17:31:06,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d86af9e95/12daaa82cbcc4ef2b34230e6ca1f1850 [2024-10-14 17:31:06,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:31:06,659 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:31:06,660 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:31:06,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:31:06,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:31:06,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:31:06" (1/1) ... [2024-10-14 17:31:06,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@864c02f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:31:06, skipping insertion in model container [2024-10-14 17:31:06,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:31:06" (1/1) ... [2024-10-14 17:31:06,716 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:31:07,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:31:07,283 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-10-14 17:31:07,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@53c68ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:31:07, skipping insertion in model container [2024-10-14 17:31:07,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:31:07,284 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 17:31:07,285 INFO L158 Benchmark]: Toolchain (without parser) took 625.07ms. Allocated memory is still 178.3MB. Free memory was 108.1MB in the beginning and 136.8MB in the end (delta: -28.6MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2024-10-14 17:31:07,285 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:31:07,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 623.45ms. Allocated memory is still 178.3MB. Free memory was 107.8MB in the beginning and 136.8MB in the end (delta: -29.0MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2024-10-14 17:31:07,287 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.16ms. Allocated memory is still 104.9MB. Free memory is still 66.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 623.45ms. Allocated memory is still 178.3MB. Free memory was 107.8MB in the beginning and 136.8MB in the end (delta: -29.0MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 990]: 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4a058bd9944921e52018f99044f11f694f824f3f09daf510330544b4558ba193 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:31:09,256 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:31:09,323 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-10-14 17:31:09,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:31:09,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:31:09,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:31:09,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:31:09,352 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:31:09,352 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:31:09,352 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:31:09,352 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:31:09,353 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:31:09,353 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:31:09,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:31:09,353 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:31:09,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:31:09,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:31:09,354 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:31:09,354 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:31:09,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:31:09,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:31:09,358 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:31:09,358 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:31:09,358 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:31:09,358 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:31:09,358 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:31:09,358 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:31:09,359 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 17:31:09,359 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:31:09,359 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 17:31:09,359 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:31:09,359 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:31:09,360 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:31:09,360 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:31:09,360 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:31:09,360 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:31:09,360 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:31:09,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:31:09,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:31:09,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:31:09,361 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:31:09,364 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 17:31:09,364 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 17:31:09,364 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:31:09,364 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:31:09,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:31:09,365 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:31:09,365 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 17:31:09,365 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4a058bd9944921e52018f99044f11f694f824f3f09daf510330544b4558ba193 [2024-10-14 17:31:09,621 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:31:09,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:31:09,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:31:09,642 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:31:09,643 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:31:09,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i [2024-10-14 17:31:11,231 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:31:11,498 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:31:11,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test6-2.i [2024-10-14 17:31:11,517 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/605516421/3bde0548323e4ddcb163f6c371be4203/FLAG2351ec6e9 [2024-10-14 17:31:11,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/605516421/3bde0548323e4ddcb163f6c371be4203 [2024-10-14 17:31:11,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:31:11,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:31:11,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:31:11,554 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:31:11,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:31:11,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:31:11" (1/1) ... [2024-10-14 17:31:11,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7315fbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:31:11, skipping insertion in model container [2024-10-14 17:31:11,560 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:31:11" (1/1) ... [2024-10-14 17:31:11,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:31:12,040 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:31:12,051 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 17:31:12,062 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:31:12,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:31:12,171 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:31:12,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:31:12,344 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:31:12,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:31:12 WrapperNode [2024-10-14 17:31:12,346 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:31:12,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:31:12,347 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:31:12,347 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:31:12,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:31:12" (1/1) ... [2024-10-14 17:31:12,384 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:31:12" (1/1) ... [2024-10-14 17:31:12,430 INFO L138 Inliner]: procedures = 285, calls = 343, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1224 [2024-10-14 17:31:12,433 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:31:12,434 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:31:12,434 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:31:12,434 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:31:12,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:31:12" (1/1) ... [2024-10-14 17:31:12,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:31:12" (1/1) ... [2024-10-14 17:31:12,464 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:31:12" (1/1) ... [2024-10-14 17:31:12,540 INFO L175 MemorySlicer]: Split 309 memory accesses to 4 slices as follows [2, 270, 3, 34]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 63 writes are split as follows [0, 57, 2, 4]. [2024-10-14 17:31:12,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:31:12" (1/1) ... [2024-10-14 17:31:12,540 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:31:12" (1/1) ... [2024-10-14 17:31:12,611 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:31:12" (1/1) ... [2024-10-14 17:31:12,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:31:12" (1/1) ... [2024-10-14 17:31:12,632 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:31:12" (1/1) ... [2024-10-14 17:31:12,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:31:12" (1/1) ... [2024-10-14 17:31:12,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:31:12,643 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:31:12,643 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:31:12,644 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:31:12,644 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:31:12" (1/1) ... [2024-10-14 17:31:12,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:31:12,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:31:12,678 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-10-14 17:31:12,683 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-10-14 17:31:12,727 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-14 17:31:12,728 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-14 17:31:12,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 17:31:12,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 17:31:12,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 17:31:12,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-10-14 17:31:12,729 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 17:31:12,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 17:31:12,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 17:31:12,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-10-14 17:31:12,730 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 17:31:12,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 17:31:12,730 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 17:31:12,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 17:31:12,731 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-14 17:31:12,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:31:12,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 17:31:12,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 17:31:12,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 17:31:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-10-14 17:31:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 17:31:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 17:31:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 17:31:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-10-14 17:31:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-10-14 17:31:12,732 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-10-14 17:31:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 17:31:12,732 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 17:31:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:31:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:31:12,733 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-10-14 17:31:12,733 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-10-14 17:31:12,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 17:31:12,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 17:31:12,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 17:31:12,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-14 17:31:12,733 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-10-14 17:31:12,733 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-10-14 17:31:12,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:31:12,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:31:12,960 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:31:12,962 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:31:16,352 INFO L? ?]: Removed 170 outVars from TransFormulas that were not future-live. [2024-10-14 17:31:16,352 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:31:16,395 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:31:16,399 INFO L314 CfgBuilder]: Removed 72 assume(true) statements. [2024-10-14 17:31:16,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:31:16 BoogieIcfgContainer [2024-10-14 17:31:16,399 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:31:16,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:31:16,401 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:31:16,403 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:31:16,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:31:11" (1/3) ... [2024-10-14 17:31:16,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd9fff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:31:16, skipping insertion in model container [2024-10-14 17:31:16,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:31:12" (2/3) ... [2024-10-14 17:31:16,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cd9fff0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:31:16, skipping insertion in model container [2024-10-14 17:31:16,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:31:16" (3/3) ... [2024-10-14 17:31:16,409 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test6-2.i [2024-10-14 17:31:16,432 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:31:16,432 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 17:31:16,485 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:31:16,489 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;@294d8f66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:31:16,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 17:31:16,492 INFO L276 IsEmpty]: Start isEmpty. Operand has 259 states, 232 states have (on average 1.6336206896551724) internal successors, (379), 237 states have internal predecessors, (379), 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-10-14 17:31:16,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 17:31:16,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:31:16,497 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:31:16,498 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:31:16,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:31:16,501 INFO L85 PathProgramCache]: Analyzing trace with hash -711634754, now seen corresponding path program 1 times [2024-10-14 17:31:16,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:31:16,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1806558313] [2024-10-14 17:31:16,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:31:16,512 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-10-14 17:31:16,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:31:16,515 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-10-14 17:31:16,516 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-10-14 17:31:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:31:16,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 17:31:16,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:31:16,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:31:16,705 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:31:16,706 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:31:16,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1806558313] [2024-10-14 17:31:16,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1806558313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:31:16,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:31:16,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:31:16,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153741722] [2024-10-14 17:31:16,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:31:16,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 17:31:16,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:31:16,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 17:31:16,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 17:31:16,735 INFO L87 Difference]: Start difference. First operand has 259 states, 232 states have (on average 1.6336206896551724) internal successors, (379), 237 states have internal predecessors, (379), 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 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-10-14 17:31:16,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:31:16,793 INFO L93 Difference]: Finished difference Result 254 states and 332 transitions. [2024-10-14 17:31:16,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 17:31:16,796 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 9 [2024-10-14 17:31:16,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:31:16,806 INFO L225 Difference]: With dead ends: 254 [2024-10-14 17:31:16,806 INFO L226 Difference]: Without dead ends: 253 [2024-10-14 17:31:16,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 17:31:16,810 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:31:16,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 323 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:31:16,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-10-14 17:31:16,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2024-10-14 17:31:16,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 228 states have (on average 1.3026315789473684) internal successors, (297), 233 states have internal predecessors, (297), 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-10-14 17:31:16,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 331 transitions. [2024-10-14 17:31:16,861 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 331 transitions. Word has length 9 [2024-10-14 17:31:16,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:31:16,861 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 331 transitions. [2024-10-14 17:31:16,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-10-14 17:31:16,862 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 331 transitions. [2024-10-14 17:31:16,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-14 17:31:16,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:31:16,863 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:31:16,867 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 (2)] Forceful destruction successful, exit code 0 [2024-10-14 17:31:17,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-10-14 17:31:17,066 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:31:17,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:31:17,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1093340257, now seen corresponding path program 1 times [2024-10-14 17:31:17,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:31:17,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203179833] [2024-10-14 17:31:17,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:31:17,068 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-10-14 17:31:17,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:31:17,074 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-10-14 17:31:17,075 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-10-14 17:31:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:31:17,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 17:31:17,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:31:17,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:31:17,294 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:31:17,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:31:17,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1203179833] [2024-10-14 17:31:17,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1203179833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:31:17,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:31:17,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:31:17,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683125842] [2024-10-14 17:31:17,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:31:17,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:31:17,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:31:17,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:31:17,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:31:17,298 INFO L87 Difference]: Start difference. First operand 253 states and 331 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:31:18,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:31:20,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:31:20,780 INFO L93 Difference]: Finished difference Result 406 states and 533 transitions. [2024-10-14 17:31:20,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:31:20,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-14 17:31:20,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:31:20,782 INFO L225 Difference]: With dead ends: 406 [2024-10-14 17:31:20,782 INFO L226 Difference]: Without dead ends: 406 [2024-10-14 17:31:20,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-10-14 17:31:20,784 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 183 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:31:20,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 919 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-14 17:31:20,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-10-14 17:31:20,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 370. [2024-10-14 17:31:20,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 342 states have (on average 1.304093567251462) internal successors, (446), 347 states have internal predecessors, (446), 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-10-14 17:31:20,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 486 transitions. [2024-10-14 17:31:20,828 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 486 transitions. Word has length 11 [2024-10-14 17:31:20,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:31:20,828 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 486 transitions. [2024-10-14 17:31:20,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:31:20,828 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 486 transitions. [2024-10-14 17:31:20,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 17:31:20,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:31:20,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:31:20,833 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-10-14 17:31:21,029 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-10-14 17:31:21,029 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:31:21,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:31:21,031 INFO L85 PathProgramCache]: Analyzing trace with hash -2126280651, now seen corresponding path program 1 times [2024-10-14 17:31:21,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:31:21,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129708264] [2024-10-14 17:31:21,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:31:21,032 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-10-14 17:31:21,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:31:21,034 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-10-14 17:31:21,035 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-10-14 17:31:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:31:21,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 17:31:21,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:31:21,234 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:31:21,235 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:31:21,235 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:31:21,249 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-10-14 17:31:21,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:31:21,311 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-10-14 17:31:21,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:31:21,327 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:31:21,331 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:31:21,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129708264] [2024-10-14 17:31:21,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129708264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:31:21,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:31:21,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:31:21,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62230220] [2024-10-14 17:31:21,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:31:21,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:31:21,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:31:21,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:31:21,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:31:21,333 INFO L87 Difference]: Start difference. First operand 370 states and 486 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-14 17:31:21,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:31:21,694 INFO L93 Difference]: Finished difference Result 581 states and 770 transitions. [2024-10-14 17:31:21,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:31:21,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2024-10-14 17:31:21,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:31:21,697 INFO L225 Difference]: With dead ends: 581 [2024-10-14 17:31:21,697 INFO L226 Difference]: Without dead ends: 581 [2024-10-14 17:31:21,697 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-10-14 17:31:21,698 INFO L432 NwaCegarLoop]: 360 mSDtfsCounter, 270 mSDsluCounter, 651 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 17:31:21,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 1011 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 17:31:21,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2024-10-14 17:31:21,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 369. [2024-10-14 17:31:21,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 341 states have (on average 1.3020527859237536) internal successors, (444), 346 states have internal predecessors, (444), 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-10-14 17:31:21,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 484 transitions. [2024-10-14 17:31:21,712 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 484 transitions. Word has length 14 [2024-10-14 17:31:21,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:31:21,712 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 484 transitions. [2024-10-14 17:31:21,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-14 17:31:21,712 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 484 transitions. [2024-10-14 17:31:21,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-14 17:31:21,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:31:21,713 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] [2024-10-14 17:31:21,726 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-10-14 17:31:21,917 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-10-14 17:31:21,918 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:31:21,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:31:21,918 INFO L85 PathProgramCache]: Analyzing trace with hash -130810140, now seen corresponding path program 1 times [2024-10-14 17:31:21,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:31:21,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595847498] [2024-10-14 17:31:21,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:31:21,919 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-10-14 17:31:21,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:31:21,921 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-10-14 17:31:21,922 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-10-14 17:31:22,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:31:22,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 17:31:22,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:31:22,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:31:22,176 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:31:22,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:31:22,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595847498] [2024-10-14 17:31:22,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595847498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:31:22,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:31:22,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:31:22,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128775447] [2024-10-14 17:31:22,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:31:22,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:31:22,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:31:22,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:31:22,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:31:22,178 INFO L87 Difference]: Start difference. First operand 369 states and 484 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:31:22,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:31:22,284 INFO L93 Difference]: Finished difference Result 375 states and 474 transitions. [2024-10-14 17:31:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:31:22,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 1 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 48 [2024-10-14 17:31:22,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:31:22,286 INFO L225 Difference]: With dead ends: 375 [2024-10-14 17:31:22,286 INFO L226 Difference]: Without dead ends: 375 [2024-10-14 17:31:22,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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-10-14 17:31:22,287 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 30 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:31:22,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 862 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:31:22,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-14 17:31:22,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2024-10-14 17:31:22,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 347 states have (on average 1.2507204610951008) internal successors, (434), 352 states have internal predecessors, (434), 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-10-14 17:31:22,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 474 transitions. [2024-10-14 17:31:22,296 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 474 transitions. Word has length 48 [2024-10-14 17:31:22,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:31:22,297 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 474 transitions. [2024-10-14 17:31:22,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (3), 1 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:31:22,297 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 474 transitions. [2024-10-14 17:31:22,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-14 17:31:22,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:31:22,298 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] [2024-10-14 17:31:22,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-14 17:31:22,499 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-10-14 17:31:22,499 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:31:22,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:31:22,499 INFO L85 PathProgramCache]: Analyzing trace with hash 323773912, now seen corresponding path program 1 times [2024-10-14 17:31:22,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:31:22,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [731671079] [2024-10-14 17:31:22,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:31:22,500 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-10-14 17:31:22,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:31:22,503 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-10-14 17:31:22,504 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-10-14 17:31:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:31:22,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 17:31:22,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:31:22,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:31:22,744 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:31:22,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:31:22,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [731671079] [2024-10-14 17:31:22,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [731671079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:31:22,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:31:22,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 17:31:22,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661784380] [2024-10-14 17:31:22,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:31:22,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:31:22,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:31:22,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:31:22,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:31:22,746 INFO L87 Difference]: Start difference. First operand 375 states and 474 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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-10-14 17:31:22,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:31:22,872 INFO L93 Difference]: Finished difference Result 384 states and 483 transitions. [2024-10-14 17:31:22,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:31:22,873 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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 48 [2024-10-14 17:31:22,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:31:22,874 INFO L225 Difference]: With dead ends: 384 [2024-10-14 17:31:22,874 INFO L226 Difference]: Without dead ends: 384 [2024-10-14 17:31:22,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 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-10-14 17:31:22,875 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 8 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:31:22,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1530 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:31:22,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-10-14 17:31:22,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2024-10-14 17:31:22,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 353 states have (on average 1.2492917847025495) internal successors, (441), 359 states have internal predecessors, (441), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 17:31:22,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 483 transitions. [2024-10-14 17:31:22,882 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 483 transitions. Word has length 48 [2024-10-14 17:31:22,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:31:22,882 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 483 transitions. [2024-10-14 17:31:22,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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-10-14 17:31:22,882 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 483 transitions. [2024-10-14 17:31:22,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-14 17:31:22,883 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:31:22,884 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:31:22,891 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-10-14 17:31:23,084 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-10-14 17:31:23,085 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:31:23,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:31:23,085 INFO L85 PathProgramCache]: Analyzing trace with hash -441157344, now seen corresponding path program 1 times [2024-10-14 17:31:23,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:31:23,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957521289] [2024-10-14 17:31:23,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:31:23,086 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-10-14 17:31:23,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:31:23,089 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-10-14 17:31:23,090 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-10-14 17:31:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:31:23,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 17:31:23,355 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:31:23,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:31:23,442 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:31:23,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:31:23,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957521289] [2024-10-14 17:31:23,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957521289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:31:23,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:31:23,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:31:23,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175402733] [2024-10-14 17:31:23,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:31:23,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:31:23,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:31:23,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:31:23,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:31:23,445 INFO L87 Difference]: Start difference. First operand 384 states and 483 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:31:23,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:31:23,617 INFO L93 Difference]: Finished difference Result 390 states and 491 transitions. [2024-10-14 17:31:23,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:31:23,618 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 60 [2024-10-14 17:31:23,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:31:23,622 INFO L225 Difference]: With dead ends: 390 [2024-10-14 17:31:23,622 INFO L226 Difference]: Without dead ends: 390 [2024-10-14 17:31:23,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 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-10-14 17:31:23,623 INFO L432 NwaCegarLoop]: 297 mSDtfsCounter, 17 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:31:23,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1126 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:31:23,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2024-10-14 17:31:23,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 387. [2024-10-14 17:31:23,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 354 states have (on average 1.2485875706214689) internal successors, (442), 361 states have internal predecessors, (442), 24 states have call successors, (24), 7 states have call predecessors, (24), 7 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2024-10-14 17:31:23,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 487 transitions. [2024-10-14 17:31:23,646 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 487 transitions. Word has length 60 [2024-10-14 17:31:23,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:31:23,647 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 487 transitions. [2024-10-14 17:31:23,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-14 17:31:23,648 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 487 transitions. [2024-10-14 17:31:23,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 17:31:23,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:31:23,651 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:31:23,660 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-10-14 17:31:23,851 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-10-14 17:31:23,852 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:31:23,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:31:23,853 INFO L85 PathProgramCache]: Analyzing trace with hash 468705426, now seen corresponding path program 1 times [2024-10-14 17:31:23,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:31:23,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547101095] [2024-10-14 17:31:23,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:31:23,854 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-10-14 17:31:23,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:31:23,859 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-10-14 17:31:23,860 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-10-14 17:31:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:31:24,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 17:31:24,199 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:31:24,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:31:24,225 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:31:24,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:31:24,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547101095] [2024-10-14 17:31:24,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [547101095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:31:24,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:31:24,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:31:24,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72216008] [2024-10-14 17:31:24,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:31:24,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:31:24,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:31:24,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:31:24,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:31:24,229 INFO L87 Difference]: Start difference. First operand 387 states and 487 transitions. Second operand has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:31:24,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:31:24,315 INFO L93 Difference]: Finished difference Result 389 states and 490 transitions. [2024-10-14 17:31:24,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:31:24,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 65 [2024-10-14 17:31:24,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:31:24,317 INFO L225 Difference]: With dead ends: 389 [2024-10-14 17:31:24,317 INFO L226 Difference]: Without dead ends: 389 [2024-10-14 17:31:24,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:31:24,318 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 0 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:31:24,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 922 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:31:24,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-10-14 17:31:24,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 389. [2024-10-14 17:31:24,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 355 states have (on average 1.2507042253521128) internal successors, (444), 363 states have internal predecessors, (444), 24 states have call successors, (24), 7 states have call predecessors, (24), 8 states have return successors, (22), 19 states have call predecessors, (22), 20 states have call successors, (22) [2024-10-14 17:31:24,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 490 transitions. [2024-10-14 17:31:24,328 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 490 transitions. Word has length 65 [2024-10-14 17:31:24,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:31:24,329 INFO L471 AbstractCegarLoop]: Abstraction has 389 states and 490 transitions. [2024-10-14 17:31:24,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.666666666666668) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-10-14 17:31:24,329 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 490 transitions. [2024-10-14 17:31:24,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 17:31:24,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:31:24,333 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:31:24,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-14 17:31:24,533 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-10-14 17:31:24,533 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:31:24,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:31:24,534 INFO L85 PathProgramCache]: Analyzing trace with hash -638364359, now seen corresponding path program 1 times [2024-10-14 17:31:24,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:31:24,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063571586] [2024-10-14 17:31:24,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:31:24,535 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-10-14 17:31:24,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:31:24,538 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-10-14 17:31:24,538 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-10-14 17:31:24,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:31:24,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 17:31:24,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:31:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:31:24,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:31:25,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:31:25,028 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:31:25,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1063571586] [2024-10-14 17:31:25,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1063571586] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:31:25,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:31:25,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 17:31:25,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74087410] [2024-10-14 17:31:25,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:31:25,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 17:31:25,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:31:25,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 17:31:25,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:31:25,030 INFO L87 Difference]: Start difference. First operand 389 states and 490 transitions. Second operand has 8 states, 6 states have (on average 10.0) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 17:31:25,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:31:25,232 INFO L93 Difference]: Finished difference Result 398 states and 504 transitions. [2024-10-14 17:31:25,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 17:31:25,232 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.0) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 66 [2024-10-14 17:31:25,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:31:25,234 INFO L225 Difference]: With dead ends: 398 [2024-10-14 17:31:25,234 INFO L226 Difference]: Without dead ends: 398 [2024-10-14 17:31:25,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-14 17:31:25,234 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 5 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 1224 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:31:25,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 1224 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:31:25,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-10-14 17:31:25,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 397. [2024-10-14 17:31:25,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 362 states have (on average 1.2624309392265194) internal successors, (457), 370 states have internal predecessors, (457), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (22), 19 states have call predecessors, (22), 20 states have call successors, (22) [2024-10-14 17:31:25,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 503 transitions. [2024-10-14 17:31:25,242 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 503 transitions. Word has length 66 [2024-10-14 17:31:25,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:31:25,242 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 503 transitions. [2024-10-14 17:31:25,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.0) internal successors, (60), 8 states have internal predecessors, (60), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 17:31:25,242 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 503 transitions. [2024-10-14 17:31:25,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 17:31:25,244 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:31:25,244 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:31:25,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 17:31:25,448 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-10-14 17:31:25,449 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:31:25,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:31:25,449 INFO L85 PathProgramCache]: Analyzing trace with hash 997937746, now seen corresponding path program 2 times [2024-10-14 17:31:25,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:31:25,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248686957] [2024-10-14 17:31:25,451 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:31:25,451 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-10-14 17:31:25,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:31:25,453 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-10-14 17:31:25,456 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-10-14 17:31:25,884 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:31:25,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:31:25,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 17:31:25,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:31:25,971 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:31:25,971 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:31:26,235 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:31:26,238 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:31:26,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248686957] [2024-10-14 17:31:26,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [248686957] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:31:26,238 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:31:26,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-14 17:31:26,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241551740] [2024-10-14 17:31:26,239 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:31:26,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 17:31:26,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:31:26,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 17:31:26,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-14 17:31:26,240 INFO L87 Difference]: Start difference. First operand 397 states and 503 transitions. Second operand has 14 states, 12 states have (on average 5.5) internal successors, (66), 14 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 17:31:26,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:31:26,942 INFO L93 Difference]: Finished difference Result 409 states and 522 transitions. [2024-10-14 17:31:26,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 17:31:26,942 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.5) internal successors, (66), 14 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 69 [2024-10-14 17:31:26,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:31:26,944 INFO L225 Difference]: With dead ends: 409 [2024-10-14 17:31:26,944 INFO L226 Difference]: Without dead ends: 407 [2024-10-14 17:31:26,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-14 17:31:26,945 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 7 mSDsluCounter, 2745 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 3054 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:31:26,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 3054 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:31:26,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2024-10-14 17:31:26,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 406. [2024-10-14 17:31:26,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 371 states have (on average 1.2641509433962264) internal successors, (469), 379 states have internal predecessors, (469), 24 states have call successors, (24), 8 states have call predecessors, (24), 9 states have return successors, (22), 19 states have call predecessors, (22), 20 states have call successors, (22) [2024-10-14 17:31:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 515 transitions. [2024-10-14 17:31:26,952 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 515 transitions. Word has length 69 [2024-10-14 17:31:26,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:31:26,953 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 515 transitions. [2024-10-14 17:31:26,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.5) internal successors, (66), 14 states have internal predecessors, (66), 2 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-14 17:31:26,953 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 515 transitions. [2024-10-14 17:31:26,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-14 17:31:26,954 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:31:26,954 INFO L215 NwaCegarLoop]: trace histogram [10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:31:26,969 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-10-14 17:31:27,158 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-10-14 17:31:27,159 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:31:27,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:31:27,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1628202766, now seen corresponding path program 3 times [2024-10-14 17:31:27,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:31:27,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [874483556] [2024-10-14 17:31:27,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:31:27,160 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-10-14 17:31:27,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:31:27,161 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-10-14 17:31:27,163 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-10-14 17:31:27,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 17:31:27,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:31:27,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 17:31:27,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:31:27,806 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 17:31:27,806 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:31:28,006 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-10-14 17:31:28,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:31:28,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [874483556] [2024-10-14 17:31:28,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [874483556] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:31:28,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:31:28,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-10-14 17:31:28,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501866212] [2024-10-14 17:31:28,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:31:28,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 17:31:28,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:31:28,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 17:31:28,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-14 17:31:28,008 INFO L87 Difference]: Start difference. First operand 406 states and 515 transitions. Second operand has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 10 states have internal predecessors, (107), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 17:31:29,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:31:29,462 INFO L93 Difference]: Finished difference Result 3083 states and 3979 transitions. [2024-10-14 17:31:29,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-14 17:31:29,462 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 10 states have internal predecessors, (107), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 75 [2024-10-14 17:31:29,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:31:29,476 INFO L225 Difference]: With dead ends: 3083 [2024-10-14 17:31:29,477 INFO L226 Difference]: Without dead ends: 3083 [2024-10-14 17:31:29,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=202, Invalid=610, Unknown=0, NotChecked=0, Total=812 [2024-10-14 17:31:29,477 INFO L432 NwaCegarLoop]: 862 mSDtfsCounter, 4875 mSDsluCounter, 4446 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 507 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4901 SdHoareTripleChecker+Valid, 5308 SdHoareTripleChecker+Invalid, 1315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 507 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:31:29,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4901 Valid, 5308 Invalid, 1315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [507 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 17:31:29,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2024-10-14 17:31:29,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 2121. [2024-10-14 17:31:29,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 1983 states have (on average 1.2778618255168936) internal successors, (2534), 2004 states have internal predecessors, (2534), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-10-14 17:31:29,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2734 transitions. [2024-10-14 17:31:29,530 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2734 transitions. Word has length 75 [2024-10-14 17:31:29,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:31:29,530 INFO L471 AbstractCegarLoop]: Abstraction has 2121 states and 2734 transitions. [2024-10-14 17:31:29,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 8.916666666666666) internal successors, (107), 10 states have internal predecessors, (107), 7 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-14 17:31:29,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2734 transitions. [2024-10-14 17:31:29,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-14 17:31:29,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:31:29,531 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:31:29,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-10-14 17:31:29,731 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-10-14 17:31:29,732 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:31:29,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:31:29,732 INFO L85 PathProgramCache]: Analyzing trace with hash 249438597, now seen corresponding path program 1 times [2024-10-14 17:31:29,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:31:29,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [368441035] [2024-10-14 17:31:29,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:31:29,733 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-10-14 17:31:29,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:31:29,734 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-10-14 17:31:29,736 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-10-14 17:31:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:31:30,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 17:31:30,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:31:30,420 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 74 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-14 17:31:30,420 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:31:31,009 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 2 proven. 122 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-14 17:31:31,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:31:31,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [368441035] [2024-10-14 17:31:31,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [368441035] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:31:31,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:31:31,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-14 17:31:31,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10755431] [2024-10-14 17:31:31,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:31:31,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 17:31:31,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:31:31,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 17:31:31,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-14 17:31:31,012 INFO L87 Difference]: Start difference. First operand 2121 states and 2734 transitions. Second operand has 26 states, 24 states have (on average 4.666666666666667) internal successors, (112), 26 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 17:31:33,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:31:33,489 INFO L93 Difference]: Finished difference Result 2226 states and 2919 transitions. [2024-10-14 17:31:33,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 17:31:33,490 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 4.666666666666667) internal successors, (112), 26 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 111 [2024-10-14 17:31:33,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:31:33,496 INFO L225 Difference]: With dead ends: 2226 [2024-10-14 17:31:33,497 INFO L226 Difference]: Without dead ends: 2216 [2024-10-14 17:31:33,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 17:31:33,498 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 14 mSDsluCounter, 3965 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4274 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 17:31:33,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4274 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 17:31:33,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2024-10-14 17:31:33,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 2211. [2024-10-14 17:31:33,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2211 states, 2073 states have (on average 1.2802701398938736) internal successors, (2654), 2094 states have internal predecessors, (2654), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-10-14 17:31:33,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 2854 transitions. [2024-10-14 17:31:33,534 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 2854 transitions. Word has length 111 [2024-10-14 17:31:33,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:31:33,534 INFO L471 AbstractCegarLoop]: Abstraction has 2211 states and 2854 transitions. [2024-10-14 17:31:33,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 4.666666666666667) internal successors, (112), 26 states have internal predecessors, (112), 2 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-10-14 17:31:33,534 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 2854 transitions. [2024-10-14 17:31:33,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-14 17:31:33,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:31:33,535 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:31:33,549 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-10-14 17:31:33,735 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-10-14 17:31:33,736 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:31:33,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:31:33,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1525892965, now seen corresponding path program 2 times [2024-10-14 17:31:33,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:31:33,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412692814] [2024-10-14 17:31:33,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:31:33,738 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-10-14 17:31:33,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:31:33,739 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-10-14 17:31:33,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 (13)] Waiting until timeout for monitored process [2024-10-14 17:31:34,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 17:31:34,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:31:34,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 17:31:34,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:31:34,052 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:31:34,053 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:31:34,053 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 17:31:34,055 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-10-14 17:31:34,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:31:34,087 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-10-14 17:31:34,095 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2024-10-14 17:31:34,095 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:31:34,095 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:31:34,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412692814] [2024-10-14 17:31:34,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1412692814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:31:34,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:31:34,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:31:34,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959089867] [2024-10-14 17:31:34,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:31:34,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:31:34,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:31:34,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:31:34,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:31:34,097 INFO L87 Difference]: Start difference. First operand 2211 states and 2854 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 17:31:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:31:34,492 INFO L93 Difference]: Finished difference Result 2963 states and 3856 transitions. [2024-10-14 17:31:34,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:31:34,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 129 [2024-10-14 17:31:34,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:31:34,500 INFO L225 Difference]: With dead ends: 2963 [2024-10-14 17:31:34,500 INFO L226 Difference]: Without dead ends: 2963 [2024-10-14 17:31:34,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 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-10-14 17:31:34,501 INFO L432 NwaCegarLoop]: 293 mSDtfsCounter, 212 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:31:34,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 867 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 17:31:34,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2963 states. [2024-10-14 17:31:34,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2963 to 2223. [2024-10-14 17:31:34,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2223 states, 2085 states have (on average 1.2786570743405277) internal successors, (2666), 2106 states have internal predecessors, (2666), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-10-14 17:31:34,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 2866 transitions. [2024-10-14 17:31:34,536 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 2866 transitions. Word has length 129 [2024-10-14 17:31:34,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:31:34,536 INFO L471 AbstractCegarLoop]: Abstraction has 2223 states and 2866 transitions. [2024-10-14 17:31:34,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-14 17:31:34,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 2866 transitions. [2024-10-14 17:31:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-14 17:31:34,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:31:34,537 INFO L215 NwaCegarLoop]: trace histogram [33, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:31:34,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 (13)] Ended with exit code 0 [2024-10-14 17:31:34,738 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-10-14 17:31:34,738 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:31:34,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:31:34,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1915621368, now seen corresponding path program 1 times [2024-10-14 17:31:34,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:31:34,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219999313] [2024-10-14 17:31:34,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:31:34,740 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-10-14 17:31:34,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:31:34,743 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 17:31:34,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-14 17:31:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:31:35,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-14 17:31:35,372 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:31:35,885 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 311 proven. 253 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-10-14 17:31:35,886 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:31:37,597 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 554 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-10-14 17:31:37,597 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:31:37,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219999313] [2024-10-14 17:31:37,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219999313] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:31:37,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:31:37,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-14 17:31:37,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737247508] [2024-10-14 17:31:37,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:31:37,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 17:31:37,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:31:37,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 17:31:37,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 17:31:37,600 INFO L87 Difference]: Start difference. First operand 2223 states and 2866 transitions. Second operand has 50 states, 48 states have (on average 2.7083333333333335) internal successors, (130), 50 states have internal predecessors, (130), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 17:31:48,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:31:48,183 INFO L93 Difference]: Finished difference Result 2408 states and 3211 transitions. [2024-10-14 17:31:48,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-14 17:31:48,186 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.7083333333333335) internal successors, (130), 50 states have internal predecessors, (130), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 133 [2024-10-14 17:31:48,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:31:48,196 INFO L225 Difference]: With dead ends: 2408 [2024-10-14 17:31:48,196 INFO L226 Difference]: Without dead ends: 2398 [2024-10-14 17:31:48,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-14 17:31:48,203 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 25 mSDsluCounter, 7320 mSDsCounter, 0 mSdLazyCounter, 2149 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 7629 SdHoareTripleChecker+Invalid, 2176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 2149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-14 17:31:48,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 7629 Invalid, 2176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 2149 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-14 17:31:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2024-10-14 17:31:48,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2393. [2024-10-14 17:31:48,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2393 states, 2255 states have (on average 1.2842572062084257) internal successors, (2896), 2276 states have internal predecessors, (2896), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-10-14 17:31:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2393 states to 2393 states and 3096 transitions. [2024-10-14 17:31:48,246 INFO L78 Accepts]: Start accepts. Automaton has 2393 states and 3096 transitions. Word has length 133 [2024-10-14 17:31:48,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:31:48,246 INFO L471 AbstractCegarLoop]: Abstraction has 2393 states and 3096 transitions. [2024-10-14 17:31:48,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.7083333333333335) internal successors, (130), 50 states have internal predecessors, (130), 2 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-14 17:31:48,247 INFO L276 IsEmpty]: Start isEmpty. Operand 2393 states and 3096 transitions. [2024-10-14 17:31:48,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-10-14 17:31:48,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:31:48,248 INFO L215 NwaCegarLoop]: trace histogram [67, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:31:48,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-10-14 17:31:48,451 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-10-14 17:31:48,452 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:31:48,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:31:48,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1083881752, now seen corresponding path program 2 times [2024-10-14 17:31:48,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:31:48,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459213929] [2024-10-14 17:31:48,453 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:31:48,454 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-10-14 17:31:48,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:31:48,459 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-10-14 17:31:48,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-14 17:31:50,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:31:50,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:31:50,148 INFO L255 TraceCheckSpWp]: Trace formula consists of 1415 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-10-14 17:31:50,152 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:31:50,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2433 backedges. 1162 proven. 276 refuted. 0 times theorem prover too weak. 995 trivial. 0 not checked. [2024-10-14 17:31:50,728 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:31:53,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2433 backedges. 1081 proven. 301 refuted. 0 times theorem prover too weak. 1051 trivial. 0 not checked. [2024-10-14 17:31:53,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:31:53,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459213929] [2024-10-14 17:31:53,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459213929] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:31:53,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:31:53,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-10-14 17:31:53,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284042614] [2024-10-14 17:31:53,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:31:53,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-14 17:31:53,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:31:53,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-14 17:31:53,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-10-14 17:31:53,068 INFO L87 Difference]: Start difference. First operand 2393 states and 3096 transitions. Second operand has 52 states, 50 states have (on average 2.62) internal successors, (131), 52 states have internal predecessors, (131), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 17:32:06,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:32:06,538 INFO L93 Difference]: Finished difference Result 2528 states and 3356 transitions. [2024-10-14 17:32:06,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-10-14 17:32:06,539 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 50 states have (on average 2.62) internal successors, (131), 52 states have internal predecessors, (131), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 167 [2024-10-14 17:32:06,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:32:06,544 INFO L225 Difference]: With dead ends: 2528 [2024-10-14 17:32:06,544 INFO L226 Difference]: Without dead ends: 2528 [2024-10-14 17:32:06,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 379 GetRequests, 282 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-10-14 17:32:06,547 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 26 mSDsluCounter, 7320 mSDsCounter, 0 mSdLazyCounter, 1598 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 7628 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 17:32:06,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 7628 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1598 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 17:32:06,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2024-10-14 17:32:06,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2518. [2024-10-14 17:32:06,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2518 states, 2380 states have (on average 1.3218487394957983) internal successors, (3146), 2401 states have internal predecessors, (3146), 98 states have call successors, (98), 36 states have call predecessors, (98), 38 states have return successors, (102), 80 states have call predecessors, (102), 94 states have call successors, (102) [2024-10-14 17:32:06,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2518 states to 2518 states and 3346 transitions. [2024-10-14 17:32:06,570 INFO L78 Accepts]: Start accepts. Automaton has 2518 states and 3346 transitions. Word has length 167 [2024-10-14 17:32:06,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:32:06,571 INFO L471 AbstractCegarLoop]: Abstraction has 2518 states and 3346 transitions. [2024-10-14 17:32:06,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 50 states have (on average 2.62) internal successors, (131), 52 states have internal predecessors, (131), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-14 17:32:06,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2518 states and 3346 transitions. [2024-10-14 17:32:06,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-14 17:32:06,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:32:06,572 INFO L215 NwaCegarLoop]: trace histogram [92, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:32:06,595 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-10-14 17:32:06,776 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-10-14 17:32:06,777 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:32:06,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:32:06,777 INFO L85 PathProgramCache]: Analyzing trace with hash -309569537, now seen corresponding path program 3 times [2024-10-14 17:32:06,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:32:06,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956042457] [2024-10-14 17:32:06,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 17:32:06,778 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-10-14 17:32:06,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:32:06,781 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-10-14 17:32:06,781 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-10-14 17:32:07,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-10-14 17:32:07,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:32:07,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-14 17:32:07,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:32:07,876 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 44 treesize of output 53 [2024-10-14 17:32:08,123 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 454 treesize of output 334 [2024-10-14 17:32:08,132 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 334 treesize of output 214 [2024-10-14 17:32:08,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:32:08,146 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 214 treesize of output 94 [2024-10-14 17:32:09,637 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 164 treesize of output 116 [2024-10-14 17:32:09,639 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 116 treesize of output 68 [2024-10-14 17:32:09,643 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:32:09,643 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 68 treesize of output 20 [2024-10-14 17:32:09,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:32:09,983 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 214 treesize of output 106 [2024-10-14 17:32:10,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4483 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 4379 trivial. 0 not checked. [2024-10-14 17:32:10,125 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:32:10,125 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:32:10,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956042457] [2024-10-14 17:32:10,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [956042457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:32:10,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:32:10,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-14 17:32:10,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049170139] [2024-10-14 17:32:10,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:32:10,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 17:32:10,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:32:10,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 17:32:10,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-10-14 17:32:10,127 INFO L87 Difference]: Start difference. First operand 2518 states and 3346 transitions. Second operand has 16 states, 12 states have (on average 6.75) internal successors, (81), 13 states have internal predecessors, (81), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 17:32:13,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:32:18,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-14 17:32:20,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 17:32:21,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:32:21,305 INFO L93 Difference]: Finished difference Result 3149 states and 4176 transitions. [2024-10-14 17:32:21,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-14 17:32:21,306 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 6.75) internal successors, (81), 13 states have internal predecessors, (81), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 192 [2024-10-14 17:32:21,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:32:21,312 INFO L225 Difference]: With dead ends: 3149 [2024-10-14 17:32:21,313 INFO L226 Difference]: Without dead ends: 3144 [2024-10-14 17:32:21,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2024-10-14 17:32:21,313 INFO L432 NwaCegarLoop]: 361 mSDtfsCounter, 371 mSDsluCounter, 2724 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 3085 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2024-10-14 17:32:21,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 3085 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2024-10-14 17:32:21,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3144 states. [2024-10-14 17:32:21,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3144 to 2781. [2024-10-14 17:32:21,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2781 states, 2627 states have (on average 1.3090978302245908) internal successors, (3439), 2651 states have internal predecessors, (3439), 108 states have call successors, (108), 41 states have call predecessors, (108), 44 states have return successors, (117), 88 states have call predecessors, (117), 104 states have call successors, (117) [2024-10-14 17:32:21,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2781 states to 2781 states and 3664 transitions. [2024-10-14 17:32:21,341 INFO L78 Accepts]: Start accepts. Automaton has 2781 states and 3664 transitions. Word has length 192 [2024-10-14 17:32:21,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:32:21,341 INFO L471 AbstractCegarLoop]: Abstraction has 2781 states and 3664 transitions. [2024-10-14 17:32:21,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 6.75) internal successors, (81), 13 states have internal predecessors, (81), 5 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-10-14 17:32:21,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2781 states and 3664 transitions. [2024-10-14 17:32:21,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-10-14 17:32:21,342 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:32:21,343 INFO L215 NwaCegarLoop]: trace histogram [93, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:32:21,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-10-14 17:32:21,543 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-10-14 17:32:21,543 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:32:21,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:32:21,544 INFO L85 PathProgramCache]: Analyzing trace with hash -711273574, now seen corresponding path program 4 times [2024-10-14 17:32:21,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 17:32:21,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373571707] [2024-10-14 17:32:21,544 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 17:32:21,544 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-10-14 17:32:21,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 17:32:21,547 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-10-14 17:32:21,548 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-10-14 17:32:23,410 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 17:32:23,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:32:23,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 1701 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-14 17:32:23,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:32:25,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4578 backedges. 2406 proven. 1176 refuted. 0 times theorem prover too weak. 996 trivial. 0 not checked. [2024-10-14 17:32:25,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:32:32,088 INFO L134 CoverageAnalysis]: Checked inductivity of 4578 backedges. 2206 proven. 1275 refuted. 0 times theorem prover too weak. 1097 trivial. 0 not checked. [2024-10-14 17:32:32,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 17:32:32,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [373571707] [2024-10-14 17:32:32,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [373571707] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:32:32,088 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 17:32:32,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-10-14 17:32:32,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725389119] [2024-10-14 17:32:32,089 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 17:32:32,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-10-14 17:32:32,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 17:32:32,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-10-14 17:32:32,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-10-14 17:32:32,094 INFO L87 Difference]: Start difference. First operand 2781 states and 3664 transitions. Second operand has 102 states, 100 states have (on average 1.82) internal successors, (182), 102 states have internal predecessors, (182), 2 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)