./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-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 cb52e740550b0ec41396d39fc3beea75c2dcd7385105eaeaaabca1f449d4b319 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:14:01,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:14:01,788 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-17 00:14:01,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:14:01,792 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:14:01,811 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:14:01,811 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:14:01,812 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:14:01,813 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:14:01,816 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:14:01,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:14:01,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:14:01,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:14:01,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:14:01,818 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:14:01,818 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:14:01,818 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 00:14:01,818 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:14:01,819 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:14:01,819 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:14:01,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:14:01,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 00:14:01,821 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:14:01,821 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:14:01,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:14:01,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 00:14:01,822 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:14:01,822 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:14:01,822 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:14:01,822 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:14:01,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 00:14:01,823 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:14:01,823 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:14:01,823 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:14:01,823 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:14:01,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:14:01,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:14:01,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:14:01,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:14:01,825 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 00:14:01,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 00:14:01,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:14:01,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:14:01,826 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:14:01,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:14:01,826 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 -> cb52e740550b0ec41396d39fc3beea75c2dcd7385105eaeaaabca1f449d4b319 [2024-11-17 00:14:02,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:14:02,100 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:14:02,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:14:02,105 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:14:02,105 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:14:02,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-2.i [2024-11-17 00:14:03,470 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:14:03,742 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:14:03,743 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-2.i [2024-11-17 00:14:03,769 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be10ce0b3/6f02ca5233ee4ecda0f8faa824b184fb/FLAGdcb6532c9 [2024-11-17 00:14:03,783 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be10ce0b3/6f02ca5233ee4ecda0f8faa824b184fb [2024-11-17 00:14:03,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:14:03,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:14:03,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:14:03,792 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:14:03,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:14:03,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:14:03" (1/1) ... [2024-11-17 00:14:03,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2da85e81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:14:03, skipping insertion in model container [2024-11-17 00:14:03,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:14:03" (1/1) ... [2024-11-17 00:14:03,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:14:04,536 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:04,560 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:04,563 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:04,570 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:04,580 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:04,609 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:04,609 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:04,610 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:04,612 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:04,613 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:04,615 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:04,616 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:04,617 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:04,618 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:04,621 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:04,626 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:14:04,633 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-17 00:14:04,634 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3f8f0a2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:14:04, skipping insertion in model container [2024-11-17 00:14:04,634 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:14:04,634 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-17 00:14:04,639 INFO L158 Benchmark]: Toolchain (without parser) took 845.73ms. Allocated memory is still 178.3MB. Free memory was 100.5MB in the beginning and 112.5MB in the end (delta: -12.0MB). Peak memory consumption was 6.9MB. Max. memory is 16.1GB. [2024-11-17 00:14:04,640 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 178.3MB. Free memory was 134.1MB in the beginning and 134.0MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 00:14:04,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 842.36ms. Allocated memory is still 178.3MB. Free memory was 100.3MB in the beginning and 112.5MB in the end (delta: -12.2MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-11-17 00:14:04,641 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.31ms. Allocated memory is still 178.3MB. Free memory was 134.1MB in the beginning and 134.0MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 842.36ms. Allocated memory is still 178.3MB. Free memory was 100.3MB in the beginning and 112.5MB in the end (delta: -12.2MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 2239]: 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_SFH_test9-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 cb52e740550b0ec41396d39fc3beea75c2dcd7385105eaeaaabca1f449d4b319 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 00:14:06,551 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 00:14:06,594 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-17 00:14:06,598 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 00:14:06,598 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 00:14:06,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 00:14:06,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 00:14:06,619 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 00:14:06,619 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 00:14:06,619 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 00:14:06,620 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 00:14:06,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 00:14:06,621 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 00:14:06,621 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 00:14:06,621 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 00:14:06,622 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 00:14:06,622 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-17 00:14:06,622 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 00:14:06,635 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 00:14:06,636 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 00:14:06,636 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 00:14:06,636 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-17 00:14:06,636 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 00:14:06,637 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 00:14:06,637 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 00:14:06,637 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-17 00:14:06,637 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 00:14:06,637 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 00:14:06,638 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 00:14:06,638 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 00:14:06,638 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 00:14:06,639 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 00:14:06,639 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-17 00:14:06,639 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 00:14:06,640 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 00:14:06,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 00:14:06,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 00:14:06,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 00:14:06,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:14:06,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 00:14:06,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 00:14:06,641 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 00:14:06,641 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 00:14:06,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 00:14:06,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 00:14:06,642 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 00:14:06,642 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 00:14:06,642 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 -> cb52e740550b0ec41396d39fc3beea75c2dcd7385105eaeaaabca1f449d4b319 [2024-11-17 00:14:06,900 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 00:14:06,941 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 00:14:06,944 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 00:14:06,946 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 00:14:06,946 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 00:14:06,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-2.i [2024-11-17 00:14:08,547 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 00:14:08,832 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 00:14:08,833 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test9-2.i [2024-11-17 00:14:08,857 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b30a571c9/c7e7b3f40167471bbda00ace7e1127a3/FLAGf7076f7c7 [2024-11-17 00:14:08,878 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b30a571c9/c7e7b3f40167471bbda00ace7e1127a3 [2024-11-17 00:14:08,885 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 00:14:08,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 00:14:08,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 00:14:08,887 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 00:14:08,891 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 00:14:08,892 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:14:08" (1/1) ... [2024-11-17 00:14:08,894 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c569bc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:14:08, skipping insertion in model container [2024-11-17 00:14:08,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 12:14:08" (1/1) ... [2024-11-17 00:14:08,958 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:14:09,547 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,562 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,568 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,574 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,580 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,613 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,614 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,615 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,616 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,617 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,618 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,619 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,621 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,623 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,625 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,633 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:14:09,645 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-17 00:14:09,658 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 00:14:09,735 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,747 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,749 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,751 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,754 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,764 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,764 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,765 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,766 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,767 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,768 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,768 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,769 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,769 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,771 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 00:14:09,772 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:14:09,776 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 00:14:09,884 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 00:14:09,914 INFO L204 MainTranslator]: Completed translation [2024-11-17 00:14:09,915 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:14:09 WrapperNode [2024-11-17 00:14:09,915 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 00:14:09,916 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 00:14:09,916 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 00:14:09,916 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 00:14:09,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:14:09" (1/1) ... [2024-11-17 00:14:09,981 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:14:09" (1/1) ... [2024-11-17 00:14:10,050 INFO L138 Inliner]: procedures = 180, calls = 775, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3008 [2024-11-17 00:14:10,051 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 00:14:10,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 00:14:10,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 00:14:10,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 00:14:10,064 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:14:09" (1/1) ... [2024-11-17 00:14:10,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:14:09" (1/1) ... [2024-11-17 00:14:10,080 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:14:09" (1/1) ... [2024-11-17 00:14:10,190 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-11-17 00:14:10,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:14:09" (1/1) ... [2024-11-17 00:14:10,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:14:09" (1/1) ... [2024-11-17 00:14:10,255 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:14:09" (1/1) ... [2024-11-17 00:14:10,258 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:14:09" (1/1) ... [2024-11-17 00:14:10,267 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:14:09" (1/1) ... [2024-11-17 00:14:10,283 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:14:09" (1/1) ... [2024-11-17 00:14:10,301 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 00:14:10,302 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 00:14:10,305 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 00:14:10,305 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 00:14:10,306 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:14:09" (1/1) ... [2024-11-17 00:14:10,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 00:14:10,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 00:14:10,348 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-17 00:14:10,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-17 00:14:10,406 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-17 00:14:10,406 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-17 00:14:10,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-17 00:14:10,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-17 00:14:10,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-17 00:14:10,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-17 00:14:10,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-17 00:14:10,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-17 00:14:10,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 00:14:10,408 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 00:14:10,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 00:14:10,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 00:14:10,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-17 00:14:10,409 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 00:14:10,409 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 00:14:10,409 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-17 00:14:10,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 00:14:10,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 00:14:10,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 00:14:10,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 00:14:10,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 00:14:10,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 00:14:10,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 00:14:10,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 00:14:10,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 00:14:10,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 00:14:10,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 00:14:10,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-17 00:14:10,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-17 00:14:10,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 00:14:10,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-17 00:14:10,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-17 00:14:10,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 00:14:10,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 00:14:10,601 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 00:14:10,603 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 00:14:19,015 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L2218: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-17 00:14:19,227 INFO L? ?]: Removed 637 outVars from TransFormulas that were not future-live. [2024-11-17 00:14:19,227 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 00:14:19,268 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 00:14:19,268 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 00:14:19,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:14:19 BoogieIcfgContainer [2024-11-17 00:14:19,269 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 00:14:19,270 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 00:14:19,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 00:14:19,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 00:14:19,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 12:14:08" (1/3) ... [2024-11-17 00:14:19,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c55f6e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:14:19, skipping insertion in model container [2024-11-17 00:14:19,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 12:14:09" (2/3) ... [2024-11-17 00:14:19,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c55f6e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 12:14:19, skipping insertion in model container [2024-11-17 00:14:19,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 12:14:19" (3/3) ... [2024-11-17 00:14:19,276 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test9-2.i [2024-11-17 00:14:19,291 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 00:14:19,291 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-17 00:14:19,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 00:14:19,362 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;@1cf0b741, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 00:14:19,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-17 00:14:19,369 INFO L276 IsEmpty]: Start isEmpty. Operand has 1213 states, 702 states have (on average 1.8945868945868947) internal successors, (1330), 1206 states have internal predecessors, (1330), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) [2024-11-17 00:14:19,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-17 00:14:19,376 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:14:19,377 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:14:19,377 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:14:19,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:14:19,382 INFO L85 PathProgramCache]: Analyzing trace with hash -224342327, now seen corresponding path program 1 times [2024-11-17 00:14:19,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:14:19,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1044992416] [2024-11-17 00:14:19,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:14:19,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:19,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:14:19,395 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:14:19,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-17 00:14:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:14:19,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-17 00:14:19,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:14:19,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:14:19,536 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:14:19,537 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:14:19,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1044992416] [2024-11-17 00:14:19,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1044992416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:14:19,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:14:19,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 00:14:19,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452543166] [2024-11-17 00:14:19,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:14:19,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-17 00:14:19,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:14:19,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-17 00:14:19,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:14:19,567 INFO L87 Difference]: Start difference. First operand has 1213 states, 702 states have (on average 1.8945868945868947) internal successors, (1330), 1206 states have internal predecessors, (1330), 505 states have call successors, (505), 3 states have call predecessors, (505), 3 states have return successors, (505), 6 states have call predecessors, (505), 505 states have call successors, (505) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:14:19,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:14:19,644 INFO L93 Difference]: Finished difference Result 1211 states and 2268 transitions. [2024-11-17 00:14:19,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-17 00:14:19,646 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-17 00:14:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:14:19,668 INFO L225 Difference]: With dead ends: 1211 [2024-11-17 00:14:19,668 INFO L226 Difference]: Without dead ends: 1208 [2024-11-17 00:14:19,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-17 00:14:19,672 INFO L432 NwaCegarLoop]: 2268 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2268 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 00:14:19,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2268 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:14:19,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2024-11-17 00:14:19,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1208. [2024-11-17 00:14:19,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 699 states have (on average 1.798283261802575) internal successors, (1257), 1201 states have internal predecessors, (1257), 505 states have call successors, (505), 3 states have call predecessors, (505), 2 states have return successors, (503), 4 states have call predecessors, (503), 503 states have call successors, (503) [2024-11-17 00:14:19,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 2265 transitions. [2024-11-17 00:14:19,928 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 2265 transitions. Word has length 11 [2024-11-17 00:14:19,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:14:19,929 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 2265 transitions. [2024-11-17 00:14:19,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:14:19,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 2265 transitions. [2024-11-17 00:14:19,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:14:19,929 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:14:19,930 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:14:19,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-17 00:14:20,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:20,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:14:20,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:14:20,133 INFO L85 PathProgramCache]: Analyzing trace with hash -486100604, now seen corresponding path program 1 times [2024-11-17 00:14:20,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:14:20,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1046458883] [2024-11-17 00:14:20,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:14:20,134 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:20,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:14:20,153 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:14:20,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-17 00:14:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:14:20,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:14:20,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:14:20,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:14:20,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:14:20,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:14:20,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1046458883] [2024-11-17 00:14:20,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1046458883] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:14:20,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:14:20,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 00:14:20,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440215527] [2024-11-17 00:14:20,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:14:20,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 00:14:20,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:14:20,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 00:14:20,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:14:20,361 INFO L87 Difference]: Start difference. First operand 1208 states and 2265 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:14:21,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:14:21,031 INFO L93 Difference]: Finished difference Result 2333 states and 4426 transitions. [2024-11-17 00:14:21,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 00:14:21,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2024-11-17 00:14:21,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:14:21,044 INFO L225 Difference]: With dead ends: 2333 [2024-11-17 00:14:21,045 INFO L226 Difference]: Without dead ends: 2333 [2024-11-17 00:14:21,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 00:14:21,046 INFO L432 NwaCegarLoop]: 2253 mSDtfsCounter, 1151 mSDsluCounter, 2239 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1651 SdHoareTripleChecker+Valid, 4492 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.6s IncrementalHoareTripleChecker+Time [2024-11-17 00:14:21,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1651 Valid, 4492 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 00:14:21,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2333 states. [2024-11-17 00:14:21,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2333 to 2300. [2024-11-17 00:14:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2300 states, 1291 states have (on average 1.8404337722695585) internal successors, (2376), 2293 states have internal predecessors, (2376), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-17 00:14:21,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2300 states to 2300 states and 4384 transitions. [2024-11-17 00:14:21,301 INFO L78 Accepts]: Start accepts. Automaton has 2300 states and 4384 transitions. Word has length 15 [2024-11-17 00:14:21,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:14:21,302 INFO L471 AbstractCegarLoop]: Abstraction has 2300 states and 4384 transitions. [2024-11-17 00:14:21,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:14:21,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2300 states and 4384 transitions. [2024-11-17 00:14:21,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 00:14:21,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:14:21,303 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:14:21,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-17 00:14:21,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:21,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:14:21,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:14:21,506 INFO L85 PathProgramCache]: Analyzing trace with hash 401403077, now seen corresponding path program 1 times [2024-11-17 00:14:21,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:14:21,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226802529] [2024-11-17 00:14:21,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:14:21,507 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:21,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:14:21,512 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:14:21,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-17 00:14:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:14:21,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:14:21,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:14:21,674 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:14:21,675 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:14:21,675 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:14:21,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-17 00:14:21,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:14:21,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-17 00:14:21,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 00:14:21,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:14:21,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:14:21,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226802529] [2024-11-17 00:14:21,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226802529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:14:21,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:14:21,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:14:21,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678492373] [2024-11-17 00:14:21,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:14:21,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:14:21,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:14:21,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:14:21,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:14:21,763 INFO L87 Difference]: Start difference. First operand 2300 states and 4384 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:14:24,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:14:24,024 INFO L93 Difference]: Finished difference Result 4452 states and 8581 transitions. [2024-11-17 00:14:24,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:14:24,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2024-11-17 00:14:24,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:14:24,042 INFO L225 Difference]: With dead ends: 4452 [2024-11-17 00:14:24,043 INFO L226 Difference]: Without dead ends: 4452 [2024-11-17 00:14:24,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-17 00:14:24,044 INFO L432 NwaCegarLoop]: 2527 mSDtfsCounter, 1235 mSDsluCounter, 4265 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 6792 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:14:24,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1738 Valid, 6792 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-17 00:14:24,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4452 states. [2024-11-17 00:14:24,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4452 to 2299. [2024-11-17 00:14:24,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2299 states, 1290 states have (on average 1.84031007751938) internal successors, (2374), 2292 states have internal predecessors, (2374), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-17 00:14:24,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2299 states to 2299 states and 4382 transitions. [2024-11-17 00:14:24,363 INFO L78 Accepts]: Start accepts. Automaton has 2299 states and 4382 transitions. Word has length 15 [2024-11-17 00:14:24,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:14:24,363 INFO L471 AbstractCegarLoop]: Abstraction has 2299 states and 4382 transitions. [2024-11-17 00:14:24,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 00:14:24,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2299 states and 4382 transitions. [2024-11-17 00:14:24,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-17 00:14:24,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:14:24,366 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, 1, 1] [2024-11-17 00:14:24,373 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-17 00:14:24,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:24,567 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:14:24,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:14:24,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1115700075, now seen corresponding path program 1 times [2024-11-17 00:14:24,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:14:24,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747721196] [2024-11-17 00:14:24,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:14:24,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:24,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:14:24,576 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:14:24,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-17 00:14:24,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:14:24,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:14:24,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:14:24,934 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-17 00:14:24,934 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:14:24,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:14:24,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747721196] [2024-11-17 00:14:24,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747721196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:14:24,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:14:24,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:14:24,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815931550] [2024-11-17 00:14:24,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:14:24,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:14:24,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:14:24,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:14:24,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:14:24,937 INFO L87 Difference]: Start difference. First operand 2299 states and 4382 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-17 00:14:25,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:14:25,110 INFO L93 Difference]: Finished difference Result 2305 states and 4372 transitions. [2024-11-17 00:14:25,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:14:25,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 87 [2024-11-17 00:14:25,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:14:25,119 INFO L225 Difference]: With dead ends: 2305 [2024-11-17 00:14:25,120 INFO L226 Difference]: Without dead ends: 2305 [2024-11-17 00:14:25,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:14:25,121 INFO L432 NwaCegarLoop]: 2235 mSDtfsCounter, 30 mSDsluCounter, 4450 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 6685 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-17 00:14:25,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 6685 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:14:25,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2305 states. [2024-11-17 00:14:25,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2305 to 2305. [2024-11-17 00:14:25,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2305 states, 1296 states have (on average 1.8240740740740742) internal successors, (2364), 2298 states have internal predecessors, (2364), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 2 states have return successors, (1003), 5 states have call predecessors, (1003), 1003 states have call successors, (1003) [2024-11-17 00:14:25,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2305 states to 2305 states and 4372 transitions. [2024-11-17 00:14:25,321 INFO L78 Accepts]: Start accepts. Automaton has 2305 states and 4372 transitions. Word has length 87 [2024-11-17 00:14:25,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:14:25,322 INFO L471 AbstractCegarLoop]: Abstraction has 2305 states and 4372 transitions. [2024-11-17 00:14:25,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-17 00:14:25,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2305 states and 4372 transitions. [2024-11-17 00:14:25,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-17 00:14:25,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:14:25,323 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, 1, 1] [2024-11-17 00:14:25,334 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-17 00:14:25,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:25,528 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:14:25,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:14:25,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1446538980, now seen corresponding path program 1 times [2024-11-17 00:14:25,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:14:25,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1764397388] [2024-11-17 00:14:25,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:14:25,533 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:25,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:14:25,536 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:14:25,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-17 00:14:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:14:25,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:14:25,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:14:25,918 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-17 00:14:25,918 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:14:25,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:14:25,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1764397388] [2024-11-17 00:14:25,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1764397388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:14:25,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:14:25,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:14:25,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264700155] [2024-11-17 00:14:25,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:14:25,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:14:25,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:14:25,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:14:25,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:14:25,921 INFO L87 Difference]: Start difference. First operand 2305 states and 4372 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-17 00:14:25,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:14:25,976 INFO L93 Difference]: Finished difference Result 2308 states and 4376 transitions. [2024-11-17 00:14:25,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:14:25,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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 87 [2024-11-17 00:14:25,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:14:25,986 INFO L225 Difference]: With dead ends: 2308 [2024-11-17 00:14:25,986 INFO L226 Difference]: Without dead ends: 2308 [2024-11-17 00:14:25,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 84 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-17 00:14:25,987 INFO L432 NwaCegarLoop]: 2251 mSDtfsCounter, 0 mSDsluCounter, 4498 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6749 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-17 00:14:25,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6749 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 00:14:25,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2308 states. [2024-11-17 00:14:26,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2308 to 2308. [2024-11-17 00:14:26,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2308 states, 1298 states have (on average 1.8235747303543914) internal successors, (2367), 2301 states have internal predecessors, (2367), 1005 states have call successors, (1005), 3 states have call predecessors, (1005), 3 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-17 00:14:26,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2308 states to 2308 states and 4376 transitions. [2024-11-17 00:14:26,191 INFO L78 Accepts]: Start accepts. Automaton has 2308 states and 4376 transitions. Word has length 87 [2024-11-17 00:14:26,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:14:26,191 INFO L471 AbstractCegarLoop]: Abstraction has 2308 states and 4376 transitions. [2024-11-17 00:14:26,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 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-17 00:14:26,192 INFO L276 IsEmpty]: Start isEmpty. Operand 2308 states and 4376 transitions. [2024-11-17 00:14:26,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-17 00:14:26,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:14:26,193 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, 1, 1] [2024-11-17 00:14:26,207 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-17 00:14:26,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:26,397 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:14:26,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:14:26,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1846132224, now seen corresponding path program 1 times [2024-11-17 00:14:26,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:14:26,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602660815] [2024-11-17 00:14:26,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:14:26,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:26,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:14:26,400 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:14:26,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 (7)] Waiting until timeout for monitored process [2024-11-17 00:14:26,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:14:26,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 00:14:26,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:14:26,824 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-17 00:14:26,825 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:14:26,927 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-17 00:14:26,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:14:26,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602660815] [2024-11-17 00:14:26,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602660815] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:14:26,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:14:26,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-17 00:14:26,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899465590] [2024-11-17 00:14:26,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:14:26,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 00:14:26,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:14:26,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 00:14:26,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 00:14:26,933 INFO L87 Difference]: Start difference. First operand 2308 states and 4376 transitions. Second operand has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-17 00:14:27,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:14:27,105 INFO L93 Difference]: Finished difference Result 2319 states and 4392 transitions. [2024-11-17 00:14:27,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 00:14:27,106 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 89 [2024-11-17 00:14:27,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:14:27,116 INFO L225 Difference]: With dead ends: 2319 [2024-11-17 00:14:27,117 INFO L226 Difference]: Without dead ends: 2319 [2024-11-17 00:14:27,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-17 00:14:27,118 INFO L432 NwaCegarLoop]: 2251 mSDtfsCounter, 5 mSDsluCounter, 4501 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6752 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.1s IncrementalHoareTripleChecker+Time [2024-11-17 00:14:27,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6752 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:14:27,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2024-11-17 00:14:27,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2317. [2024-11-17 00:14:27,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2317 states, 1306 states have (on average 1.8231240428790199) internal successors, (2381), 2309 states have internal predecessors, (2381), 1005 states have call successors, (1005), 4 states have call predecessors, (1005), 4 states have return successors, (1004), 5 states have call predecessors, (1004), 1003 states have call successors, (1004) [2024-11-17 00:14:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 4390 transitions. [2024-11-17 00:14:27,337 INFO L78 Accepts]: Start accepts. Automaton has 2317 states and 4390 transitions. Word has length 89 [2024-11-17 00:14:27,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:14:27,338 INFO L471 AbstractCegarLoop]: Abstraction has 2317 states and 4390 transitions. [2024-11-17 00:14:27,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.625) internal successors, (93), 8 states have internal predecessors, (93), 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-17 00:14:27,342 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 4390 transitions. [2024-11-17 00:14:27,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-17 00:14:27,343 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:14:27,343 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] [2024-11-17 00:14:27,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-17 00:14:27,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:27,544 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:14:27,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:14:27,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1465654716, now seen corresponding path program 2 times [2024-11-17 00:14:27,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:14:27,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683147791] [2024-11-17 00:14:27,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:14:27,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:27,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:14:27,549 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:14:27,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-17 00:14:27,762 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 00:14:27,762 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:14:27,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 00:14:27,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:14:27,818 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-17 00:14:27,819 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:14:27,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:14:27,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683147791] [2024-11-17 00:14:27,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683147791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:14:27,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:14:27,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:14:27,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807393980] [2024-11-17 00:14:27,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:14:27,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:14:27,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:14:27,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:14:27,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:14:27,821 INFO L87 Difference]: Start difference. First operand 2317 states and 4390 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-17 00:14:32,278 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-17 00:14:36,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-17 00:14:41,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:14:41,848 INFO L93 Difference]: Finished difference Result 3455 states and 6570 transitions. [2024-11-17 00:14:41,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:14:41,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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 93 [2024-11-17 00:14:41,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:14:41,859 INFO L225 Difference]: With dead ends: 3455 [2024-11-17 00:14:41,859 INFO L226 Difference]: Without dead ends: 3455 [2024-11-17 00:14:41,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:14:41,860 INFO L432 NwaCegarLoop]: 2304 mSDtfsCounter, 3530 mSDsluCounter, 2223 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 930 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4033 SdHoareTripleChecker+Valid, 4527 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 930 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:14:41,860 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4033 Valid, 4527 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [930 Valid, 622 Invalid, 2 Unknown, 0 Unchecked, 13.9s Time] [2024-11-17 00:14:41,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3455 states. [2024-11-17 00:14:42,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3455 to 3429. [2024-11-17 00:14:42,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3429 states, 1917 states have (on average 1.8377673448095984) internal successors, (3523), 3420 states have internal predecessors, (3523), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-11-17 00:14:42,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3429 states to 3429 states and 6535 transitions. [2024-11-17 00:14:42,141 INFO L78 Accepts]: Start accepts. Automaton has 3429 states and 6535 transitions. Word has length 93 [2024-11-17 00:14:42,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:14:42,142 INFO L471 AbstractCegarLoop]: Abstraction has 3429 states and 6535 transitions. [2024-11-17 00:14:42,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 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-17 00:14:42,142 INFO L276 IsEmpty]: Start isEmpty. Operand 3429 states and 6535 transitions. [2024-11-17 00:14:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-17 00:14:42,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:14:42,143 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:14:42,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-17 00:14:42,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:42,343 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:14:42,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:14:42,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1990252575, now seen corresponding path program 1 times [2024-11-17 00:14:42,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:14:42,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [891679042] [2024-11-17 00:14:42,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:14:42,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:42,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:14:42,347 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:14:42,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-17 00:14:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:14:42,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 00:14:42,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:14:42,833 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-17 00:14:42,833 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:14:42,992 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 27 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-17 00:14:42,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:14:42,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [891679042] [2024-11-17 00:14:42,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [891679042] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:14:42,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:14:42,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-17 00:14:42,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914196112] [2024-11-17 00:14:42,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:14:42,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 00:14:42,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:14:42,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 00:14:42,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-17 00:14:42,994 INFO L87 Difference]: Start difference. First operand 3429 states and 6535 transitions. Second operand has 14 states, 14 states have (on average 7.714285714285714) internal successors, (108), 14 states have internal predecessors, (108), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:14:43,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:14:43,428 INFO L93 Difference]: Finished difference Result 3444 states and 6558 transitions. [2024-11-17 00:14:43,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 00:14:43,429 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 7.714285714285714) internal successors, (108), 14 states have internal predecessors, (108), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 103 [2024-11-17 00:14:43,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:14:43,449 INFO L225 Difference]: With dead ends: 3444 [2024-11-17 00:14:43,451 INFO L226 Difference]: Without dead ends: 3440 [2024-11-17 00:14:43,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-17 00:14:43,452 INFO L432 NwaCegarLoop]: 2251 mSDtfsCounter, 8 mSDsluCounter, 15741 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 17992 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 00:14:43,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 17992 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 00:14:43,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3440 states. [2024-11-17 00:14:43,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3440 to 3438. [2024-11-17 00:14:43,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3438 states, 1926 states have (on average 1.835410176531672) internal successors, (3535), 3429 states have internal predecessors, (3535), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-11-17 00:14:43,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 6547 transitions. [2024-11-17 00:14:43,755 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 6547 transitions. Word has length 103 [2024-11-17 00:14:43,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:14:43,755 INFO L471 AbstractCegarLoop]: Abstraction has 3438 states and 6547 transitions. [2024-11-17 00:14:43,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 7.714285714285714) internal successors, (108), 14 states have internal predecessors, (108), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:14:43,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 6547 transitions. [2024-11-17 00:14:43,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-17 00:14:43,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:14:43,756 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:14:43,766 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-17 00:14:43,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:43,961 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:14:43,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:14:43,962 INFO L85 PathProgramCache]: Analyzing trace with hash -360431504, now seen corresponding path program 2 times [2024-11-17 00:14:43,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:14:43,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [628505112] [2024-11-17 00:14:43,962 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:14:43,962 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:43,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:14:43,964 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:14:43,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-17 00:14:44,257 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 00:14:44,257 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:14:44,262 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 00:14:44,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:14:44,287 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:14:44,287 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:14:44,290 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 33 treesize of output 31 [2024-11-17 00:14:44,322 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:14:44,323 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 62 treesize of output 22 [2024-11-17 00:14:44,349 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2024-11-17 00:14:44,350 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:14:44,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:14:44,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [628505112] [2024-11-17 00:14:44,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [628505112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:14:44,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:14:44,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:14:44,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541731518] [2024-11-17 00:14:44,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:14:44,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:14:44,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:14:44,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:14:44,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:14:44,352 INFO L87 Difference]: Start difference. First operand 3438 states and 6547 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-17 00:14:45,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:14:45,878 INFO L93 Difference]: Finished difference Result 6624 states and 12787 transitions. [2024-11-17 00:14:45,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 00:14:45,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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 112 [2024-11-17 00:14:45,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:14:45,899 INFO L225 Difference]: With dead ends: 6624 [2024-11-17 00:14:45,899 INFO L226 Difference]: Without dead ends: 6624 [2024-11-17 00:14:45,899 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:14:45,900 INFO L432 NwaCegarLoop]: 2595 mSDtfsCounter, 1181 mSDsluCounter, 4322 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1684 SdHoareTripleChecker+Valid, 6917 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-17 00:14:45,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1684 Valid, 6917 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-17 00:14:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6624 states. [2024-11-17 00:14:46,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6624 to 3442. [2024-11-17 00:14:46,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3442 states, 1930 states have (on average 1.8336787564766839) internal successors, (3539), 3433 states have internal predecessors, (3539), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-11-17 00:14:46,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 3442 states and 6551 transitions. [2024-11-17 00:14:46,401 INFO L78 Accepts]: Start accepts. Automaton has 3442 states and 6551 transitions. Word has length 112 [2024-11-17 00:14:46,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:14:46,401 INFO L471 AbstractCegarLoop]: Abstraction has 3442 states and 6551 transitions. [2024-11-17 00:14:46,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-17 00:14:46,402 INFO L276 IsEmpty]: Start isEmpty. Operand 3442 states and 6551 transitions. [2024-11-17 00:14:46,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-17 00:14:46,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:14:46,403 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:14:46,408 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 (10)] Forceful destruction successful, exit code 0 [2024-11-17 00:14:46,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:46,603 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:14:46,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:14:46,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1073928107, now seen corresponding path program 1 times [2024-11-17 00:14:46,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:14:46,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107499721] [2024-11-17 00:14:46,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:14:46,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:46,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:14:46,606 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:14:46,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 (11)] Waiting until timeout for monitored process [2024-11-17 00:14:47,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:14:47,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-17 00:14:47,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:14:47,195 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 71 proven. 55 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-17 00:14:47,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:14:47,568 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 2 proven. 123 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-17 00:14:47,568 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:14:47,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107499721] [2024-11-17 00:14:47,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107499721] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:14:47,568 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:14:47,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-17 00:14:47,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552863817] [2024-11-17 00:14:47,569 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:14:47,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 00:14:47,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:14:47,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 00:14:47,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-17 00:14:47,570 INFO L87 Difference]: Start difference. First operand 3442 states and 6551 transitions. Second operand has 26 states, 26 states have (on average 5.884615384615385) internal successors, (153), 26 states have internal predecessors, (153), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:14:49,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:14:49,408 INFO L93 Difference]: Finished difference Result 3466 states and 6592 transitions. [2024-11-17 00:14:49,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-17 00:14:49,410 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.884615384615385) internal successors, (153), 26 states have internal predecessors, (153), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 145 [2024-11-17 00:14:49,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:14:49,421 INFO L225 Difference]: With dead ends: 3466 [2024-11-17 00:14:49,421 INFO L226 Difference]: Without dead ends: 3462 [2024-11-17 00:14:49,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-17 00:14:49,422 INFO L432 NwaCegarLoop]: 2251 mSDtfsCounter, 14 mSDsluCounter, 24743 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 26994 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-17 00:14:49,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 26994 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-17 00:14:49,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2024-11-17 00:14:49,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3460. [2024-11-17 00:14:49,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3460 states, 1948 states have (on average 1.8290554414784395) internal successors, (3563), 3451 states have internal predecessors, (3563), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-11-17 00:14:49,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3460 states to 3460 states and 6575 transitions. [2024-11-17 00:14:49,716 INFO L78 Accepts]: Start accepts. Automaton has 3460 states and 6575 transitions. Word has length 145 [2024-11-17 00:14:49,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:14:49,717 INFO L471 AbstractCegarLoop]: Abstraction has 3460 states and 6575 transitions. [2024-11-17 00:14:49,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.884615384615385) internal successors, (153), 26 states have internal predecessors, (153), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:14:49,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3460 states and 6575 transitions. [2024-11-17 00:14:49,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-17 00:14:49,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:14:49,719 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:14:49,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-17 00:14:49,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:49,923 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:14:49,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:14:49,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1728045685, now seen corresponding path program 2 times [2024-11-17 00:14:49,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:14:49,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747094833] [2024-11-17 00:14:49,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:14:49,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:49,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:14:49,927 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:14:49,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-17 00:14:50,263 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-17 00:14:50,263 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:14:50,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 00:14:50,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:14:50,286 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 600 trivial. 0 not checked. [2024-11-17 00:14:50,287 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 00:14:50,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:14:50,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747094833] [2024-11-17 00:14:50,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747094833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 00:14:50,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 00:14:50,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 00:14:50,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322129612] [2024-11-17 00:14:50,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 00:14:50,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 00:14:50,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:14:50,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 00:14:50,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 00:14:50,288 INFO L87 Difference]: Start difference. First operand 3460 states and 6575 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:14:50,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:14:50,374 INFO L93 Difference]: Finished difference Result 3469 states and 6560 transitions. [2024-11-17 00:14:50,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 00:14:50,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 163 [2024-11-17 00:14:50,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:14:50,382 INFO L225 Difference]: With dead ends: 3469 [2024-11-17 00:14:50,382 INFO L226 Difference]: Without dead ends: 3469 [2024-11-17 00:14:50,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 00:14:50,382 INFO L432 NwaCegarLoop]: 2224 mSDtfsCounter, 30 mSDsluCounter, 4428 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 6652 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-17 00:14:50,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 6652 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 00:14:50,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3469 states. [2024-11-17 00:14:50,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3469 to 3469. [2024-11-17 00:14:50,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3469 states, 1957 states have (on average 1.8129790495656617) internal successors, (3548), 3460 states have internal predecessors, (3548), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-11-17 00:14:50,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3469 states to 3469 states and 6560 transitions. [2024-11-17 00:14:50,703 INFO L78 Accepts]: Start accepts. Automaton has 3469 states and 6560 transitions. Word has length 163 [2024-11-17 00:14:50,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:14:50,704 INFO L471 AbstractCegarLoop]: Abstraction has 3469 states and 6560 transitions. [2024-11-17 00:14:50,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:14:50,704 INFO L276 IsEmpty]: Start isEmpty. Operand 3469 states and 6560 transitions. [2024-11-17 00:14:50,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-17 00:14:50,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:14:50,705 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:14:50,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-17 00:14:50,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:50,906 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:14:50,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:14:50,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1725677650, now seen corresponding path program 1 times [2024-11-17 00:14:50,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:14:50,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1635877156] [2024-11-17 00:14:50,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 00:14:50,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:50,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:14:50,912 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:14:50,913 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-17 00:14:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 00:14:51,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-17 00:14:51,457 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:14:51,941 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 281 proven. 253 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2024-11-17 00:14:51,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:14:53,403 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 2 proven. 531 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-17 00:14:53,404 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:14:53,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1635877156] [2024-11-17 00:14:53,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1635877156] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:14:53,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:14:53,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-17 00:14:53,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936410822] [2024-11-17 00:14:53,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:14:53,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-17 00:14:53,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:14:53,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-17 00:14:53,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-17 00:14:53,406 INFO L87 Difference]: Start difference. First operand 3469 states and 6560 transitions. Second operand has 50 states, 50 states have (on average 3.54) internal successors, (177), 50 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:14:58,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:14:58,477 INFO L93 Difference]: Finished difference Result 3509 states and 6633 transitions. [2024-11-17 00:14:58,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-17 00:14:58,478 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 3.54) internal successors, (177), 50 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 163 [2024-11-17 00:14:58,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:14:58,505 INFO L225 Difference]: With dead ends: 3509 [2024-11-17 00:14:58,505 INFO L226 Difference]: Without dead ends: 3505 [2024-11-17 00:14:58,507 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 276 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-17 00:14:58,507 INFO L432 NwaCegarLoop]: 2240 mSDtfsCounter, 26 mSDsluCounter, 53712 mSDsCounter, 0 mSdLazyCounter, 1947 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 55952 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:14:58,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 55952 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1947 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-17 00:14:58,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3505 states. [2024-11-17 00:14:58,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3505 to 3503. [2024-11-17 00:14:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3503 states, 1991 states have (on average 1.8051230537418383) internal successors, (3594), 3494 states have internal predecessors, (3594), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-11-17 00:14:58,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3503 states to 3503 states and 6606 transitions. [2024-11-17 00:14:58,798 INFO L78 Accepts]: Start accepts. Automaton has 3503 states and 6606 transitions. Word has length 163 [2024-11-17 00:14:58,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:14:58,798 INFO L471 AbstractCegarLoop]: Abstraction has 3503 states and 6606 transitions. [2024-11-17 00:14:58,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 3.54) internal successors, (177), 50 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-17 00:14:58,798 INFO L276 IsEmpty]: Start isEmpty. Operand 3503 states and 6606 transitions. [2024-11-17 00:14:58,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-17 00:14:58,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:14:58,800 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:14:58,821 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-17 00:14:59,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:59,004 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:14:59,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:14:59,005 INFO L85 PathProgramCache]: Analyzing trace with hash -14783822, now seen corresponding path program 2 times [2024-11-17 00:14:59,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:14:59,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [270330307] [2024-11-17 00:14:59,006 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 00:14:59,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:14:59,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:14:59,008 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:14:59,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-17 00:15:00,013 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 00:15:00,013 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:15:00,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 1283 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-17 00:15:00,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:15:00,526 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-17 00:15:00,526 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:15:02,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 1084 proven. 276 refuted. 0 times theorem prover too weak. 991 trivial. 0 not checked. [2024-11-17 00:15:02,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:15:02,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [270330307] [2024-11-17 00:15:02,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [270330307] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 00:15:02,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:15:02,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-17 00:15:02,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209844080] [2024-11-17 00:15:02,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:15:02,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-17 00:15:02,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:15:02,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-17 00:15:02,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-17 00:15:02,449 INFO L87 Difference]: Start difference. First operand 3503 states and 6606 transitions. Second operand has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 52 states have internal predecessors, (175), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:15:09,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 00:15:09,153 INFO L93 Difference]: Finished difference Result 3532 states and 6662 transitions. [2024-11-17 00:15:09,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-17 00:15:09,154 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 52 states have internal predecessors, (175), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 197 [2024-11-17 00:15:09,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 00:15:09,165 INFO L225 Difference]: With dead ends: 3532 [2024-11-17 00:15:09,165 INFO L226 Difference]: Without dead ends: 3532 [2024-11-17 00:15:09,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-17 00:15:09,168 INFO L432 NwaCegarLoop]: 2239 mSDtfsCounter, 26 mSDsluCounter, 55927 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 58166 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-17 00:15:09,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 58166 Invalid, 1443 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [45 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-17 00:15:09,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3532 states. [2024-11-17 00:15:09,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3532 to 3528. [2024-11-17 00:15:09,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3528 states, 2016 states have (on average 1.8075396825396826) internal successors, (3644), 3519 states have internal predecessors, (3644), 1506 states have call successors, (1506), 4 states have call predecessors, (1506), 4 states have return successors, (1506), 7 states have call predecessors, (1506), 1504 states have call successors, (1506) [2024-11-17 00:15:09,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3528 states to 3528 states and 6656 transitions. [2024-11-17 00:15:09,472 INFO L78 Accepts]: Start accepts. Automaton has 3528 states and 6656 transitions. Word has length 197 [2024-11-17 00:15:09,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 00:15:09,472 INFO L471 AbstractCegarLoop]: Abstraction has 3528 states and 6656 transitions. [2024-11-17 00:15:09,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.3653846153846154) internal successors, (175), 52 states have internal predecessors, (175), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-17 00:15:09,473 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 6656 transitions. [2024-11-17 00:15:09,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-11-17 00:15:09,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 00:15:09,474 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 00:15:09,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-17 00:15:09,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:15:09,679 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-17 00:15:09,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 00:15:09,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1477743999, now seen corresponding path program 3 times [2024-11-17 00:15:09,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 00:15:09,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1423490645] [2024-11-17 00:15:09,680 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 00:15:09,681 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 00:15:09,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 00:15:09,688 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 00:15:09,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-17 00:15:10,702 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-17 00:15:10,702 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:15:10,721 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-17 00:15:10,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:15:10,733 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:15:10,733 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:15:10,734 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:15:10,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-11-17 00:15:10,873 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:15:10,874 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:15:10,874 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:15:10,875 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:15:10,876 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:15:10,877 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:15:10,878 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:15:10,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 312 treesize of output 337 [2024-11-17 00:15:14,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:15:14,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 337 treesize of output 305 [2024-11-17 00:15:15,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:15:15,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 65 [2024-11-17 00:15:15,686 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:15:15,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 58 [2024-11-17 00:15:15,728 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4374 trivial. 0 not checked. [2024-11-17 00:15:15,728 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:15:15,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 00:15:15,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1423490645] [2024-11-17 00:15:15,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1423490645] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:15:15,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [237007845] [2024-11-17 00:15:15,918 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 00:15:15,918 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-17 00:15:15,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-17 00:15:15,920 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-17 00:15:15,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2024-11-17 00:15:16,890 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-17 00:15:16,891 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 00:15:16,911 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 00:15:16,915 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 00:15:16,926 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:15:16,926 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:15:16,928 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 00:15:16,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 33 [2024-11-17 00:15:18,840 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:15:18,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 132 treesize of output 65 [2024-11-17 00:15:18,856 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 00:15:18,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 86 treesize of output 58 [2024-11-17 00:15:18,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4376 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4374 trivial. 0 not checked. [2024-11-17 00:15:18,901 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 00:15:19,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [237007845] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 00:15:19,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 00:15:19,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6] total 13 [2024-11-17 00:15:19,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501678942] [2024-11-17 00:15:19,040 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 00:15:19,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 00:15:19,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 00:15:19,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 00:15:19,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2024-11-17 00:15:19,041 INFO L87 Difference]: Start difference. First operand 3528 states and 6656 transitions. Second operand has 13 states, 13 states have (on average 11.846153846153847) internal successors, (154), 13 states have internal predecessors, (154), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 00:15:25,336 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-17 00:15:29,349 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-17 00:15:33,359 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 []