./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-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 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:19:07,404 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:19:07,492 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-09 07:19:07,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:19:07,499 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:19:07,533 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:19:07,534 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:19:07,534 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:19:07,535 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:19:07,536 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:19:07,536 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:19:07,537 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:19:07,537 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:19:07,538 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:19:07,538 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:19:07,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:19:07,539 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:19:07,539 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:19:07,540 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:19:07,540 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:19:07,540 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:19:07,541 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:19:07,541 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:19:07,542 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:19:07,542 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:19:07,542 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:19:07,543 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:19:07,543 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:19:07,543 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:19:07,544 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:19:07,544 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:19:07,544 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:19:07,544 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:19:07,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:19:07,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:19:07,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:19:07,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:19:07,546 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:19:07,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:19:07,547 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:19:07,547 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:19:07,547 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:19:07,548 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:19:07,548 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:19:07,548 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:19:07,549 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-11-09 07:19:07,825 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:19:07,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:19:07,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:19:07,856 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:19:07,857 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:19:07,859 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-2.i [2024-11-09 07:19:09,434 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:19:09,720 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:19:09,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-2.i [2024-11-09 07:19:09,744 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35befed06/ceeb4a01be164498a33214afc1396513/FLAGb86003d15 [2024-11-09 07:19:09,760 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35befed06/ceeb4a01be164498a33214afc1396513 [2024-11-09 07:19:09,764 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:19:09,765 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:19:09,766 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:19:09,767 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:19:09,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:19:09,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:19:09" (1/1) ... [2024-11-09 07:19:09,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@301425b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:09, skipping insertion in model container [2024-11-09 07:19:09,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:19:09" (1/1) ... [2024-11-09 07:19:09,845 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:19:10,365 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:10,409 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:10,417 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:10,425 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:10,435 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:10,485 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:10,487 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:10,490 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:10,491 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:10,493 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:10,494 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:10,496 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:10,497 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:10,498 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:10,503 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:10,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:19:10,528 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-09 07:19:10,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@48824656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:10, skipping insertion in model container [2024-11-09 07:19:10,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:19:10,530 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-09 07:19:10,532 INFO L158 Benchmark]: Toolchain (without parser) took 765.14ms. Allocated memory is still 155.2MB. Free memory was 96.5MB in the beginning and 73.0MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 07:19:10,532 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 155.2MB. Free memory is still 113.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:19:10,533 INFO L158 Benchmark]: CACSL2BoogieTranslator took 763.13ms. Allocated memory is still 155.2MB. Free memory was 96.0MB in the beginning and 73.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-09 07:19:10,535 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.29ms. Allocated memory is still 155.2MB. Free memory is still 113.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 763.13ms. Allocated memory is still 155.2MB. Free memory was 96.0MB in the beginning and 73.0MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 831]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-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 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:19:12,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:19:12,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-09 07:19:12,761 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:19:12,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:19:12,783 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:19:12,784 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:19:12,784 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:19:12,785 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:19:12,785 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:19:12,785 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:19:12,786 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:19:12,786 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:19:12,787 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:19:12,787 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:19:12,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:19:12,788 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:19:12,788 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:19:12,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:19:12,789 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:19:12,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:19:12,792 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:19:12,792 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:19:12,792 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:19:12,792 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:19:12,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:19:12,793 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:19:12,793 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 07:19:12,793 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:19:12,793 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 07:19:12,794 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:19:12,794 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:19:12,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:19:12,794 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:19:12,794 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:19:12,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:19:12,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:19:12,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:19:12,798 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:19:12,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:19:12,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:19:12,799 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 07:19:12,800 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 07:19:12,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:19:12,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:19:12,801 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:19:12,801 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:19:12,801 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2024-11-09 07:19:13,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:19:13,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:19:13,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:19:13,161 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:19:13,162 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:19:13,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-2.i [2024-11-09 07:19:14,805 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:19:15,155 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:19:15,156 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test2-2.i [2024-11-09 07:19:15,183 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96acd02d6/275f77f105fe43f6a50aec3d876a1536/FLAG53e3e01eb [2024-11-09 07:19:15,201 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96acd02d6/275f77f105fe43f6a50aec3d876a1536 [2024-11-09 07:19:15,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:19:15,207 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:19:15,208 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:19:15,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:19:15,213 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:19:15,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:19:15" (1/1) ... [2024-11-09 07:19:15,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29fad3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:15, skipping insertion in model container [2024-11-09 07:19:15,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:19:15" (1/1) ... [2024-11-09 07:19:15,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:19:15,755 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:15,787 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:15,792 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:15,796 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:15,808 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:15,842 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:15,843 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:15,845 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:15,846 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:15,848 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:15,851 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:15,853 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:15,854 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:15,855 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:15,859 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:15,867 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:19:15,886 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-09 07:19:15,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:19:15,957 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:15,978 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:15,981 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:15,992 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:16,001 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:16,041 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:16,043 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:16,046 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:16,046 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:16,050 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:16,052 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:16,053 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:16,056 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:16,057 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:16,062 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 07:19:16,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:19:16,081 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:19:16,186 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:19:16,234 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:19:16,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:16 WrapperNode [2024-11-09 07:19:16,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:19:16,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:19:16,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:19:16,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:19:16,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:16" (1/1) ... [2024-11-09 07:19:16,295 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:16" (1/1) ... [2024-11-09 07:19:16,372 INFO L138 Inliner]: procedures = 210, calls = 273, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1040 [2024-11-09 07:19:16,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:19:16,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:19:16,376 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:19:16,376 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:19:16,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:16" (1/1) ... [2024-11-09 07:19:16,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:16" (1/1) ... [2024-11-09 07:19:16,403 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:16" (1/1) ... [2024-11-09 07:19:16,513 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 218, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2024-11-09 07:19:16,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:16" (1/1) ... [2024-11-09 07:19:16,516 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:16" (1/1) ... [2024-11-09 07:19:16,561 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:16" (1/1) ... [2024-11-09 07:19:16,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:16" (1/1) ... [2024-11-09 07:19:16,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:16" (1/1) ... [2024-11-09 07:19:16,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:16" (1/1) ... [2024-11-09 07:19:16,608 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:19:16,609 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:19:16,609 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:19:16,609 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:19:16,610 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:16" (1/1) ... [2024-11-09 07:19:16,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:19:16,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:19:16,644 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:19:16,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:19:16,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 07:19:16,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 07:19:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-09 07:19:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 07:19:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 07:19:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 07:19:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 07:19:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 07:19:16,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 07:19:16,700 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 07:19:16,701 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 07:19:16,701 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 07:19:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 07:19:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:19:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:19:16,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 07:19:16,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 07:19:16,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 07:19:16,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 07:19:16,702 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:19:16,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 07:19:16,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 07:19:16,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 07:19:16,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:19:16,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:19:16,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:19:16,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:19:16,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 07:19:16,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:19:16,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:19:16,966 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:19:16,969 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:19:25,546 INFO L? ?]: Removed 135 outVars from TransFormulas that were not future-live. [2024-11-09 07:19:25,546 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:19:25,567 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:19:25,568 INFO L316 CfgBuilder]: Removed 63 assume(true) statements. [2024-11-09 07:19:25,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:19:25 BoogieIcfgContainer [2024-11-09 07:19:25,568 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:19:25,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:19:25,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:19:25,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:19:25,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:19:15" (1/3) ... [2024-11-09 07:19:25,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70952690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:19:25, skipping insertion in model container [2024-11-09 07:19:25,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:19:16" (2/3) ... [2024-11-09 07:19:25,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70952690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:19:25, skipping insertion in model container [2024-11-09 07:19:25,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:19:25" (3/3) ... [2024-11-09 07:19:25,581 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test2-2.i [2024-11-09 07:19:25,600 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:19:25,600 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 07:19:25,664 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:19:25,671 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;@55ebecd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:19:25,672 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 07:19:25,678 INFO L276 IsEmpty]: Start isEmpty. Operand has 201 states, 194 states have (on average 1.6597938144329898) internal successors, (322), 196 states have internal predecessors, (322), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:19:25,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 07:19:25,685 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:19:25,686 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 07:19:25,686 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:19:25,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:19:25,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1665218, now seen corresponding path program 1 times [2024-11-09 07:19:25,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:19:25,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582476289] [2024-11-09 07:19:25,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:19:25,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:25,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:19:25,708 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:19:25,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 07:19:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:19:25,887 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:19:25,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:19:26,008 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_16| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_16| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_16|)))) is different from true [2024-11-09 07:19:26,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:19:26,010 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:19:26,012 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:19:26,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582476289] [2024-11-09 07:19:26,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582476289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:19:26,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:19:26,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:19:26,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681316627] [2024-11-09 07:19:26,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:19:26,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:19:26,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:19:26,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:19:26,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-09 07:19:26,066 INFO L87 Difference]: Start difference. First operand has 201 states, 194 states have (on average 1.6597938144329898) internal successors, (322), 196 states have internal predecessors, (322), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:19:30,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:19:31,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:19:31,140 INFO L93 Difference]: Finished difference Result 299 states and 388 transitions. [2024-11-09 07:19:31,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:19:31,148 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-09 07:19:31,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:19:31,157 INFO L225 Difference]: With dead ends: 299 [2024-11-09 07:19:31,157 INFO L226 Difference]: Without dead ends: 296 [2024-11-09 07:19:31,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-09 07:19:31,161 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 126 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 389 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:19:31,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 487 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 1 Unknown, 389 Unchecked, 5.0s Time] [2024-11-09 07:19:31,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-09 07:19:31,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 198. [2024-11-09 07:19:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 192 states have (on average 1.296875) internal successors, (249), 193 states have internal predecessors, (249), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:19:31,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 255 transitions. [2024-11-09 07:19:31,207 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 255 transitions. Word has length 4 [2024-11-09 07:19:31,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:19:31,207 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 255 transitions. [2024-11-09 07:19:31,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:19:31,208 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 255 transitions. [2024-11-09 07:19:31,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:19:31,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:19:31,208 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:19:31,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-09 07:19:31,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:31,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:19:31,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:19:31,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1839730301, now seen corresponding path program 1 times [2024-11-09 07:19:31,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:19:31,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637839223] [2024-11-09 07:19:31,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:19:31,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:31,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:19:31,415 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:19:31,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 07:19:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:19:31,576 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:19:31,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:19:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:19:31,762 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:19:31,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:19:31,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637839223] [2024-11-09 07:19:31,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637839223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:19:31,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:19:31,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:19:31,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768982301] [2024-11-09 07:19:31,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:19:31,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:19:31,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:19:31,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:19:31,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:19:31,767 INFO L87 Difference]: Start difference. First operand 198 states and 255 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:19:32,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:19:32,504 INFO L93 Difference]: Finished difference Result 322 states and 414 transitions. [2024-11-09 07:19:32,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:19:32,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 07:19:32,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:19:32,507 INFO L225 Difference]: With dead ends: 322 [2024-11-09 07:19:32,508 INFO L226 Difference]: Without dead ends: 322 [2024-11-09 07:19:32,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:19:32,509 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 150 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:19:32,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 471 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:19:32,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2024-11-09 07:19:32,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 288. [2024-11-09 07:19:32,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 282 states have (on average 1.297872340425532) internal successors, (366), 283 states have internal predecessors, (366), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:19:32,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 372 transitions. [2024-11-09 07:19:32,544 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 372 transitions. Word has length 14 [2024-11-09 07:19:32,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:19:32,544 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 372 transitions. [2024-11-09 07:19:32,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:19:32,545 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 372 transitions. [2024-11-09 07:19:32,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:19:32,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:19:32,545 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:19:32,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 07:19:32,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:32,746 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:19:32,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:19:32,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1837883259, now seen corresponding path program 1 times [2024-11-09 07:19:32,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:19:32,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398702011] [2024-11-09 07:19:32,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:19:32,748 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:32,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:19:32,752 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:19:32,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 07:19:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:19:32,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:19:32,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:19:33,163 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_17| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_17| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_17|)))) is different from true [2024-11-09 07:19:33,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:19:33,164 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:19:33,164 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:19:33,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1398702011] [2024-11-09 07:19:33,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1398702011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:19:33,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:19:33,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:19:33,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354305501] [2024-11-09 07:19:33,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:19:33,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:19:33,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:19:33,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:19:33,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-09 07:19:33,167 INFO L87 Difference]: Start difference. First operand 288 states and 372 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:19:37,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:19:37,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:19:37,497 INFO L93 Difference]: Finished difference Result 367 states and 472 transitions. [2024-11-09 07:19:37,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:19:37,507 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 07:19:37,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:19:37,509 INFO L225 Difference]: With dead ends: 367 [2024-11-09 07:19:37,509 INFO L226 Difference]: Without dead ends: 365 [2024-11-09 07:19:37,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-09 07:19:37,511 INFO L432 NwaCegarLoop]: 248 mSDtfsCounter, 91 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 358 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:19:37,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 484 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 1 Unknown, 358 Unchecked, 4.3s Time] [2024-11-09 07:19:37,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-09 07:19:37,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 338. [2024-11-09 07:19:37,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 332 states have (on average 1.2951807228915662) internal successors, (430), 333 states have internal predecessors, (430), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:19:37,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 436 transitions. [2024-11-09 07:19:37,526 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 436 transitions. Word has length 14 [2024-11-09 07:19:37,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:19:37,526 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 436 transitions. [2024-11-09 07:19:37,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:19:37,527 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 436 transitions. [2024-11-09 07:19:37,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:19:37,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:19:37,528 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] [2024-11-09 07:19:37,536 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 (4)] Forceful destruction successful, exit code 0 [2024-11-09 07:19:37,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:37,729 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:19:37,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:19:37,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1271284979, now seen corresponding path program 1 times [2024-11-09 07:19:37,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:19:37,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074898230] [2024-11-09 07:19:37,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:19:37,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:37,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:19:37,734 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:19:37,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 07:19:37,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:19:37,886 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:19:37,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:19:38,087 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:19:38,088 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:19:38,088 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:19:38,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074898230] [2024-11-09 07:19:38,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074898230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:19:38,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:19:38,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:19:38,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287235356] [2024-11-09 07:19:38,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:19:38,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:19:38,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:19:38,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:19:38,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:19:38,091 INFO L87 Difference]: Start difference. First operand 338 states and 436 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:19:42,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:19:44,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:19:44,685 INFO L93 Difference]: Finished difference Result 374 states and 479 transitions. [2024-11-09 07:19:44,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:19:44,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-09 07:19:44,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:19:44,691 INFO L225 Difference]: With dead ends: 374 [2024-11-09 07:19:44,691 INFO L226 Difference]: Without dead ends: 370 [2024-11-09 07:19:44,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:19:44,692 INFO L432 NwaCegarLoop]: 275 mSDtfsCounter, 152 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:19:44,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 743 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 1 Unknown, 0 Unchecked, 6.5s Time] [2024-11-09 07:19:44,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2024-11-09 07:19:44,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 336. [2024-11-09 07:19:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 330 states have (on average 1.293939393939394) internal successors, (427), 331 states have internal predecessors, (427), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:19:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 433 transitions. [2024-11-09 07:19:44,716 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 433 transitions. Word has length 24 [2024-11-09 07:19:44,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:19:44,716 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 433 transitions. [2024-11-09 07:19:44,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:19:44,716 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 433 transitions. [2024-11-09 07:19:44,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 07:19:44,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:19:44,719 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:19:44,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 07:19:44,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:44,921 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:19:44,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:19:44,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1931809730, now seen corresponding path program 1 times [2024-11-09 07:19:44,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:19:44,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176653909] [2024-11-09 07:19:44,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:19:44,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:44,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:19:44,923 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:19:44,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 07:19:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:19:45,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:19:45,104 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:19:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:19:45,144 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:19:45,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:19:45,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176653909] [2024-11-09 07:19:45,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176653909] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:19:45,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:19:45,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:19:45,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786805218] [2024-11-09 07:19:45,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:19:45,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:19:45,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:19:45,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:19:45,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:19:45,147 INFO L87 Difference]: Start difference. First operand 336 states and 433 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:19:45,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:19:45,284 INFO L93 Difference]: Finished difference Result 345 states and 418 transitions. [2024-11-09 07:19:45,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:19:45,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-09 07:19:45,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:19:45,286 INFO L225 Difference]: With dead ends: 345 [2024-11-09 07:19:45,287 INFO L226 Difference]: Without dead ends: 345 [2024-11-09 07:19:45,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:19:45,288 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 30 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:19:45,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 656 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:19:45,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-09 07:19:45,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2024-11-09 07:19:45,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 339 states have (on average 1.2153392330383481) internal successors, (412), 340 states have internal predecessors, (412), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:19:45,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 418 transitions. [2024-11-09 07:19:45,302 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 418 transitions. Word has length 49 [2024-11-09 07:19:45,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:19:45,303 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 418 transitions. [2024-11-09 07:19:45,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:19:45,303 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 418 transitions. [2024-11-09 07:19:45,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 07:19:45,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:19:45,305 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:19:45,312 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-09 07:19:45,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:45,509 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:19:45,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:19:45,509 INFO L85 PathProgramCache]: Analyzing trace with hash -856581962, now seen corresponding path program 1 times [2024-11-09 07:19:45,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:19:45,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033872241] [2024-11-09 07:19:45,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:19:45,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:45,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:19:45,511 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:19:45,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 07:19:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:19:45,736 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:19:45,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:19:45,758 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:19:45,759 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:19:45,760 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:19:45,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-09 07:19:45,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:19:45,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-09 07:19:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:19:45,917 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:19:45,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:19:45,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033872241] [2024-11-09 07:19:45,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033872241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:19:45,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:19:45,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:19:45,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336322635] [2024-11-09 07:19:45,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:19:45,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:19:45,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:19:45,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:19:45,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:19:45,920 INFO L87 Difference]: Start difference. First operand 345 states and 418 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:19:46,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:19:46,486 INFO L93 Difference]: Finished difference Result 345 states and 425 transitions. [2024-11-09 07:19:46,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:19:46,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-09 07:19:46,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:19:46,489 INFO L225 Difference]: With dead ends: 345 [2024-11-09 07:19:46,489 INFO L226 Difference]: Without dead ends: 342 [2024-11-09 07:19:46,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:19:46,490 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 108 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:19:46,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1003 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:19:46,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-09 07:19:46,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 295. [2024-11-09 07:19:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 289 states have (on average 1.231833910034602) internal successors, (356), 290 states have internal predecessors, (356), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:19:46,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 362 transitions. [2024-11-09 07:19:46,503 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 362 transitions. Word has length 49 [2024-11-09 07:19:46,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:19:46,503 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 362 transitions. [2024-11-09 07:19:46,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:19:46,504 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 362 transitions. [2024-11-09 07:19:46,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 07:19:46,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:19:46,511 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:19:46,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 07:19:46,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:46,714 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:19:46,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:19:46,714 INFO L85 PathProgramCache]: Analyzing trace with hash 359142474, now seen corresponding path program 1 times [2024-11-09 07:19:46,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:19:46,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187424371] [2024-11-09 07:19:46,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:19:46,716 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:46,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:19:46,720 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:19:46,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 07:19:47,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:19:47,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:19:47,210 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:19:47,271 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:19:47,273 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:19:47,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:19:47,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187424371] [2024-11-09 07:19:47,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187424371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:19:47,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:19:47,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:19:47,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776535729] [2024-11-09 07:19:47,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:19:47,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:19:47,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:19:47,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:19:47,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:19:47,277 INFO L87 Difference]: Start difference. First operand 295 states and 362 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:19:47,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:19:47,462 INFO L93 Difference]: Finished difference Result 301 states and 352 transitions. [2024-11-09 07:19:47,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:19:47,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 85 [2024-11-09 07:19:47,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:19:47,465 INFO L225 Difference]: With dead ends: 301 [2024-11-09 07:19:47,465 INFO L226 Difference]: Without dead ends: 301 [2024-11-09 07:19:47,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:19:47,466 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 33 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:19:47,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 620 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:19:47,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2024-11-09 07:19:47,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2024-11-09 07:19:47,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 295 states have (on average 1.1728813559322033) internal successors, (346), 296 states have internal predecessors, (346), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:19:47,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 352 transitions. [2024-11-09 07:19:47,473 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 352 transitions. Word has length 85 [2024-11-09 07:19:47,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:19:47,473 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 352 transitions. [2024-11-09 07:19:47,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:19:47,474 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 352 transitions. [2024-11-09 07:19:47,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 07:19:47,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:19:47,476 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:19:47,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-09 07:19:47,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:47,677 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:19:47,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:19:47,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1571995686, now seen corresponding path program 1 times [2024-11-09 07:19:47,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:19:47,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1131683487] [2024-11-09 07:19:47,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:19:47,679 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:47,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:19:47,682 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:19:47,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 07:19:48,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:19:48,129 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:19:48,133 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:19:48,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:19:48,296 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:19:48,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:19:48,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1131683487] [2024-11-09 07:19:48,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1131683487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:19:48,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:19:48,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:19:48,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76713914] [2024-11-09 07:19:48,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:19:48,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:19:48,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:19:48,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:19:48,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:19:48,299 INFO L87 Difference]: Start difference. First operand 301 states and 352 transitions. Second operand has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:19:48,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:19:48,382 INFO L93 Difference]: Finished difference Result 289 states and 332 transitions. [2024-11-09 07:19:48,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:19:48,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 85 [2024-11-09 07:19:48,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:19:48,384 INFO L225 Difference]: With dead ends: 289 [2024-11-09 07:19:48,385 INFO L226 Difference]: Without dead ends: 289 [2024-11-09 07:19:48,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:19:48,386 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 2 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:19:48,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 822 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:19:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-09 07:19:48,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2024-11-09 07:19:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 283 states have (on average 1.1519434628975265) internal successors, (326), 284 states have internal predecessors, (326), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-09 07:19:48,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 332 transitions. [2024-11-09 07:19:48,394 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 332 transitions. Word has length 85 [2024-11-09 07:19:48,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:19:48,394 INFO L471 AbstractCegarLoop]: Abstraction has 289 states and 332 transitions. [2024-11-09 07:19:48,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.6) internal successors, (78), 5 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:19:48,395 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 332 transitions. [2024-11-09 07:19:48,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 07:19:48,396 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:19:48,396 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:19:48,407 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-09 07:19:48,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:48,597 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:19:48,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:19:48,597 INFO L85 PathProgramCache]: Analyzing trace with hash -368631724, now seen corresponding path program 1 times [2024-11-09 07:19:48,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:19:48,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94975522] [2024-11-09 07:19:48,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:19:48,598 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:48,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:19:48,599 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:19:48,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 07:19:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:19:49,056 INFO L255 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:19:49,058 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:19:49,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:19:49,109 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:19:49,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:19:49,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94975522] [2024-11-09 07:19:49,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [94975522] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:19:49,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:19:49,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:19:49,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319400532] [2024-11-09 07:19:49,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:19:49,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:19:49,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:19:49,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:19:49,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:19:49,112 INFO L87 Difference]: Start difference. First operand 289 states and 332 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, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:19:49,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:19:49,158 INFO L93 Difference]: Finished difference Result 292 states and 336 transitions. [2024-11-09 07:19:49,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:19:49,159 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, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 85 [2024-11-09 07:19:49,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:19:49,162 INFO L225 Difference]: With dead ends: 292 [2024-11-09 07:19:49,162 INFO L226 Difference]: Without dead ends: 292 [2024-11-09 07:19:49,162 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:19:49,163 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 0 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:19:49,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 674 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:19:49,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2024-11-09 07:19:49,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2024-11-09 07:19:49,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 285 states have (on average 1.1543859649122807) internal successors, (329), 287 states have internal predecessors, (329), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:19:49,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 336 transitions. [2024-11-09 07:19:49,170 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 336 transitions. Word has length 85 [2024-11-09 07:19:49,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:19:49,170 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 336 transitions. [2024-11-09 07:19:49,171 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, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:19:49,171 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 336 transitions. [2024-11-09 07:19:49,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-09 07:19:49,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:19:49,172 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:19:49,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 07:19:49,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:49,372 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:19:49,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:19:49,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1324618674, now seen corresponding path program 1 times [2024-11-09 07:19:49,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:19:49,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948934594] [2024-11-09 07:19:49,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:19:49,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:49,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:19:49,377 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:19:49,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 07:19:49,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:19:49,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:19:49,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:19:49,951 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:19:49,951 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:19:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:19:50,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:19:50,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948934594] [2024-11-09 07:19:50,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948934594] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:19:50,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:19:50,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-09 07:19:50,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924653159] [2024-11-09 07:19:50,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:19:50,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:19:50,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:19:50,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:19:50,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:19:50,154 INFO L87 Difference]: Start difference. First operand 292 states and 336 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:19:50,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:19:50,407 INFO L93 Difference]: Finished difference Result 303 states and 352 transitions. [2024-11-09 07:19:50,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:19:50,408 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 87 [2024-11-09 07:19:50,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:19:50,412 INFO L225 Difference]: With dead ends: 303 [2024-11-09 07:19:50,412 INFO L226 Difference]: Without dead ends: 303 [2024-11-09 07:19:50,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:19:50,413 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 5 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:19:50,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 677 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:19:50,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2024-11-09 07:19:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2024-11-09 07:19:50,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 293 states have (on average 1.1706484641638226) internal successors, (343), 295 states have internal predecessors, (343), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:19:50,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 350 transitions. [2024-11-09 07:19:50,422 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 350 transitions. Word has length 87 [2024-11-09 07:19:50,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:19:50,423 INFO L471 AbstractCegarLoop]: Abstraction has 301 states and 350 transitions. [2024-11-09 07:19:50,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 8 states have internal predecessors, (91), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:19:50,423 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 350 transitions. [2024-11-09 07:19:50,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-09 07:19:50,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:19:50,424 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:19:50,440 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-09 07:19:50,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:50,625 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:19:50,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:19:50,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1453468396, now seen corresponding path program 2 times [2024-11-09 07:19:50,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:19:50,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015926323] [2024-11-09 07:19:50,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:19:50,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:19:50,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:19:50,628 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:19:50,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 07:19:50,922 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-09 07:19:50,922 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:19:50,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:19:50,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:19:50,992 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-09 07:19:50,992 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:19:50,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:19:50,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015926323] [2024-11-09 07:19:50,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015926323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:19:50,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:19:50,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:19:50,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047599311] [2024-11-09 07:19:50,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:19:50,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:19:50,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:19:50,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:19:50,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:19:50,994 INFO L87 Difference]: Start difference. First operand 301 states and 350 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:19:55,521 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:19:59,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:20:02,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:20:04,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-09 07:20:05,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:20:05,182 INFO L93 Difference]: Finished difference Result 439 states and 521 transitions. [2024-11-09 07:20:05,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:20:05,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 91 [2024-11-09 07:20:05,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:20:05,188 INFO L225 Difference]: With dead ends: 439 [2024-11-09 07:20:05,188 INFO L226 Difference]: Without dead ends: 439 [2024-11-09 07:20:05,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:20:05,188 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 488 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 7 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:20:05,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 388 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 124 Invalid, 2 Unknown, 0 Unchecked, 14.1s Time] [2024-11-09 07:20:05,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-09 07:20:05,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 412. [2024-11-09 07:20:05,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 403 states have (on average 1.1811414392059554) internal successors, (476), 405 states have internal predecessors, (476), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 07:20:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 486 transitions. [2024-11-09 07:20:05,201 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 486 transitions. Word has length 91 [2024-11-09 07:20:05,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:20:05,203 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 486 transitions. [2024-11-09 07:20:05,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:20:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 486 transitions. [2024-11-09 07:20:05,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-09 07:20:05,204 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:20:05,204 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:20:05,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-09 07:20:05,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:20:05,405 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:20:05,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:20:05,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1931554110, now seen corresponding path program 1 times [2024-11-09 07:20:05,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:20:05,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201506749] [2024-11-09 07:20:05,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:20:05,406 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:20:05,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:20:05,407 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:20:05,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 07:20:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:20:05,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 07:20:05,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:20:06,005 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:20:06,005 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:20:06,411 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:20:06,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:20:06,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [201506749] [2024-11-09 07:20:06,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [201506749] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:20:06,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:20:06,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-09 07:20:06,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992322237] [2024-11-09 07:20:06,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:20:06,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:20:06,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:20:06,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:20:06,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:20:06,414 INFO L87 Difference]: Start difference. First operand 412 states and 486 transitions. Second operand has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:20:07,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:20:07,384 INFO L93 Difference]: Finished difference Result 427 states and 509 transitions. [2024-11-09 07:20:07,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:20:07,386 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 101 [2024-11-09 07:20:07,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:20:07,387 INFO L225 Difference]: With dead ends: 427 [2024-11-09 07:20:07,387 INFO L226 Difference]: Without dead ends: 423 [2024-11-09 07:20:07,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:20:07,388 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 8 mSDsluCounter, 1565 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1791 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:20:07,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1791 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:20:07,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2024-11-09 07:20:07,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2024-11-09 07:20:07,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 412 states have (on average 1.1844660194174756) internal successors, (488), 414 states have internal predecessors, (488), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 07:20:07,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 498 transitions. [2024-11-09 07:20:07,400 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 498 transitions. Word has length 101 [2024-11-09 07:20:07,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:20:07,401 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 498 transitions. [2024-11-09 07:20:07,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:20:07,401 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 498 transitions. [2024-11-09 07:20:07,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-09 07:20:07,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:20:07,402 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:20:07,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-09 07:20:07,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:20:07,604 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:20:07,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:20:07,604 INFO L85 PathProgramCache]: Analyzing trace with hash -2031045768, now seen corresponding path program 2 times [2024-11-09 07:20:07,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:20:07,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081895772] [2024-11-09 07:20:07,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:20:07,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:20:07,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:20:07,606 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:20:07,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 07:20:08,209 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:20:08,209 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:20:08,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 679 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 07:20:08,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:20:08,596 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 71 proven. 55 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 07:20:08,597 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:20:09,694 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 2 proven. 123 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-09 07:20:09,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:20:09,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081895772] [2024-11-09 07:20:09,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2081895772] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:20:09,695 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:20:09,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-09 07:20:09,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854152912] [2024-11-09 07:20:09,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:20:09,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 07:20:09,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:20:09,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 07:20:09,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-09 07:20:09,698 INFO L87 Difference]: Start difference. First operand 421 states and 498 transitions. Second operand has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 26 states have internal predecessors, (119), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:20:12,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:20:12,442 INFO L93 Difference]: Finished difference Result 445 states and 539 transitions. [2024-11-09 07:20:12,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-09 07:20:12,446 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 26 states have internal predecessors, (119), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 110 [2024-11-09 07:20:12,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:20:12,448 INFO L225 Difference]: With dead ends: 445 [2024-11-09 07:20:12,448 INFO L226 Difference]: Without dead ends: 441 [2024-11-09 07:20:12,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 07:20:12,452 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 14 mSDsluCounter, 2689 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2915 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:20:12,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2915 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 07:20:12,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2024-11-09 07:20:12,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 439. [2024-11-09 07:20:12,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 430 states have (on average 1.1906976744186046) internal successors, (512), 432 states have internal predecessors, (512), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 07:20:12,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 522 transitions. [2024-11-09 07:20:12,463 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 522 transitions. Word has length 110 [2024-11-09 07:20:12,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:20:12,464 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 522 transitions. [2024-11-09 07:20:12,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.576923076923077) internal successors, (119), 26 states have internal predecessors, (119), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:20:12,464 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 522 transitions. [2024-11-09 07:20:12,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 07:20:12,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:20:12,465 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:20:12,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-09 07:20:12,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:20:12,666 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:20:12,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:20:12,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1320936136, now seen corresponding path program 3 times [2024-11-09 07:20:12,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:20:12,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247417453] [2024-11-09 07:20:12,668 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:20:12,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:20:12,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:20:12,673 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:20:12,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 07:20:13,204 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-09 07:20:13,204 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:20:13,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-09 07:20:13,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:20:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-11-09 07:20:13,235 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:20:13,235 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:20:13,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247417453] [2024-11-09 07:20:13,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247417453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:20:13,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:20:13,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:20:13,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912438179] [2024-11-09 07:20:13,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:20:13,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:20:13,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:20:13,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:20:13,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:20:13,237 INFO L87 Difference]: Start difference. First operand 439 states and 522 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:20:13,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:20:13,265 INFO L93 Difference]: Finished difference Result 440 states and 523 transitions. [2024-11-09 07:20:13,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:20:13,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 128 [2024-11-09 07:20:13,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:20:13,270 INFO L225 Difference]: With dead ends: 440 [2024-11-09 07:20:13,271 INFO L226 Difference]: Without dead ends: 440 [2024-11-09 07:20:13,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:20:13,272 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 0 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:20:13,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 451 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:20:13,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-11-09 07:20:13,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2024-11-09 07:20:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 431 states have (on average 1.1902552204176333) internal successors, (513), 433 states have internal predecessors, (513), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 07:20:13,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 523 transitions. [2024-11-09 07:20:13,284 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 523 transitions. Word has length 128 [2024-11-09 07:20:13,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:20:13,284 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 523 transitions. [2024-11-09 07:20:13,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:20:13,285 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 523 transitions. [2024-11-09 07:20:13,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-09 07:20:13,287 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:20:13,288 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:20:13,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-09 07:20:13,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:20:13,488 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:20:13,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:20:13,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2022000714, now seen corresponding path program 1 times [2024-11-09 07:20:13,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:20:13,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760009621] [2024-11-09 07:20:13,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:20:13,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:20:13,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:20:13,491 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:20:13,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-09 07:20:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:20:14,185 INFO L255 TraceCheckSpWp]: Trace formula consists of 880 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-09 07:20:14,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:20:14,827 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 281 proven. 253 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-09 07:20:14,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:20:17,470 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 2 proven. 531 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-09 07:20:17,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:20:17,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760009621] [2024-11-09 07:20:17,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760009621] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:20:17,471 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:20:17,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-09 07:20:17,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570969285] [2024-11-09 07:20:17,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:20:17,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-09 07:20:17,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:20:17,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-09 07:20:17,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 07:20:17,474 INFO L87 Difference]: Start difference. First operand 440 states and 523 transitions. Second operand has 50 states, 50 states have (on average 2.86) internal successors, (143), 50 states have internal predecessors, (143), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:20:25,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:20:25,088 INFO L93 Difference]: Finished difference Result 480 states and 596 transitions. [2024-11-09 07:20:25,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-09 07:20:25,090 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.86) internal successors, (143), 50 states have internal predecessors, (143), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 128 [2024-11-09 07:20:25,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:20:25,092 INFO L225 Difference]: With dead ends: 480 [2024-11-09 07:20:25,092 INFO L226 Difference]: Without dead ends: 476 [2024-11-09 07:20:25,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-09 07:20:25,094 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 25 mSDsluCounter, 5156 mSDsCounter, 0 mSdLazyCounter, 1943 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 5382 SdHoareTripleChecker+Invalid, 1978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:20:25,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 5382 Invalid, 1978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1943 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-09 07:20:25,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2024-11-09 07:20:25,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 474. [2024-11-09 07:20:25,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 465 states have (on average 1.2021505376344086) internal successors, (559), 467 states have internal predecessors, (559), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 07:20:25,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 569 transitions. [2024-11-09 07:20:25,103 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 569 transitions. Word has length 128 [2024-11-09 07:20:25,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:20:25,103 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 569 transitions. [2024-11-09 07:20:25,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.86) internal successors, (143), 50 states have internal predecessors, (143), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:20:25,104 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 569 transitions. [2024-11-09 07:20:25,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-09 07:20:25,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:20:25,106 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:20:25,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-09 07:20:25,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:20:25,306 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:20:25,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:20:25,307 INFO L85 PathProgramCache]: Analyzing trace with hash 817815094, now seen corresponding path program 2 times [2024-11-09 07:20:25,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:20:25,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [452403947] [2024-11-09 07:20:25,308 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:20:25,308 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:20:25,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:20:25,309 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:20:25,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-09 07:20:26,458 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:20:26,459 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:20:26,493 INFO L255 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 07:20:26,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:20:27,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2024-11-09 07:20:27,141 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:20:29,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2024-11-09 07:20:29,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:20:29,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [452403947] [2024-11-09 07:20:29,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [452403947] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:20:29,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:20:29,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-09 07:20:29,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734011511] [2024-11-09 07:20:29,044 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:20:29,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-09 07:20:29,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:20:29,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-09 07:20:29,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-09 07:20:29,047 INFO L87 Difference]: Start difference. First operand 474 states and 569 transitions. Second operand has 52 states, 52 states have (on average 2.7115384615384617) internal successors, (141), 52 states have internal predecessors, (141), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:20:37,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:20:37,551 INFO L93 Difference]: Finished difference Result 503 states and 625 transitions. [2024-11-09 07:20:37,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-09 07:20:37,552 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.7115384615384617) internal successors, (141), 52 states have internal predecessors, (141), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 162 [2024-11-09 07:20:37,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:20:37,553 INFO L225 Difference]: With dead ends: 503 [2024-11-09 07:20:37,553 INFO L226 Difference]: Without dead ends: 503 [2024-11-09 07:20:37,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-09 07:20:37,556 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 27 mSDsluCounter, 5355 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 5580 SdHoareTripleChecker+Invalid, 1434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:20:37,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 5580 Invalid, 1434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-09 07:20:37,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2024-11-09 07:20:37,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 499. [2024-11-09 07:20:37,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 490 states have (on average 1.2428571428571429) internal successors, (609), 492 states have internal predecessors, (609), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 07:20:37,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 619 transitions. [2024-11-09 07:20:37,567 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 619 transitions. Word has length 162 [2024-11-09 07:20:37,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:20:37,567 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 619 transitions. [2024-11-09 07:20:37,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.7115384615384617) internal successors, (141), 52 states have internal predecessors, (141), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:20:37,567 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 619 transitions. [2024-11-09 07:20:37,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-09 07:20:37,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:20:37,569 INFO L215 NwaCegarLoop]: trace histogram [92, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:20:37,596 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 (17)] Forceful destruction successful, exit code 0 [2024-11-09 07:20:37,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:20:37,770 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:20:37,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:20:37,771 INFO L85 PathProgramCache]: Analyzing trace with hash 455740544, now seen corresponding path program 3 times [2024-11-09 07:20:37,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:20:37,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805085028] [2024-11-09 07:20:37,772 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:20:37,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:20:37,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:20:37,775 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:20:37,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process