./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef232f94cb2adf03185aed5adfaef3f0eb9593ee06bfb5b3fbb6e4bc1dd6d041 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:05:23,521 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:05:23,589 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 19:05:23,594 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:05:23,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:05:23,623 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:05:23,623 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:05:23,624 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:05:23,624 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:05:23,625 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:05:23,625 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:05:23,626 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:05:23,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:05:23,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:05:23,627 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:05:23,627 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:05:23,628 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:05:23,628 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:05:23,628 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:05:23,629 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:05:23,629 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:05:23,633 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:05:23,634 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:05:23,634 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:05:23,634 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:05:23,634 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:05:23,635 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:05:23,635 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:05:23,635 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:05:23,636 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:05:23,636 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:05:23,636 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:05:23,636 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:05:23,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:05:23,637 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:05:23,640 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:05:23,640 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 19:05:23,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 19:05:23,641 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:05:23,641 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:05:23,641 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:05:23,642 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:05:23,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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ef232f94cb2adf03185aed5adfaef3f0eb9593ee06bfb5b3fbb6e4bc1dd6d041 [2024-10-14 19:05:23,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:05:23,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:05:23,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:05:23,936 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:05:23,937 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:05:23,938 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i [2024-10-14 19:05:25,422 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:05:25,678 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:05:25,679 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i [2024-10-14 19:05:25,696 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/528fd20c3/92cd277597ef4b16b9325b0a0020416d/FLAGfdc1dc8da [2024-10-14 19:05:25,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/528fd20c3/92cd277597ef4b16b9325b0a0020416d [2024-10-14 19:05:25,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:05:25,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:05:25,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:05:25,720 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:05:25,725 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:05:25,726 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:05:25" (1/1) ... [2024-10-14 19:05:25,727 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8ba49b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:05:25, skipping insertion in model container [2024-10-14 19:05:25,728 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:05:25" (1/1) ... [2024-10-14 19:05:25,793 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:05:26,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:05:26,350 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-14 19:05:26,351 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@432f47f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:05:26, skipping insertion in model container [2024-10-14 19:05:26,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:05:26,351 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-14 19:05:26,354 INFO L158 Benchmark]: Toolchain (without parser) took 634.16ms. Allocated memory is still 197.1MB. Free memory was 142.0MB in the beginning and 120.6MB in the end (delta: 21.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 19:05:26,354 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 197.1MB. Free memory is still 174.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 19:05:26,355 INFO L158 Benchmark]: CACSL2BoogieTranslator took 631.90ms. Allocated memory is still 197.1MB. Free memory was 141.8MB in the beginning and 120.6MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-14 19:05:26,356 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.18ms. Allocated memory is still 197.1MB. Free memory is still 174.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 631.90ms. Allocated memory is still 197.1MB. Free memory was 141.8MB in the beginning and 120.6MB in the end (delta: 21.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 716]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ef232f94cb2adf03185aed5adfaef3f0eb9593ee06bfb5b3fbb6e4bc1dd6d041 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 19:05:28,470 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 19:05:28,555 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-14 19:05:28,559 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 19:05:28,561 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 19:05:28,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 19:05:28,593 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 19:05:28,595 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 19:05:28,595 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 19:05:28,596 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 19:05:28,596 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 19:05:28,597 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 19:05:28,597 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 19:05:28,601 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 19:05:28,601 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 19:05:28,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 19:05:28,602 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 19:05:28,602 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 19:05:28,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 19:05:28,603 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 19:05:28,603 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 19:05:28,604 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 19:05:28,604 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 19:05:28,604 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 19:05:28,604 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 19:05:28,605 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 19:05:28,605 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 19:05:28,605 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 19:05:28,606 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 19:05:28,606 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 19:05:28,606 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 19:05:28,607 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 19:05:28,607 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 19:05:28,607 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 19:05:28,607 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 19:05:28,607 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:05:28,608 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 19:05:28,608 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 19:05:28,611 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 19:05:28,612 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 19:05:28,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 19:05:28,614 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 19:05:28,614 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 19:05:28,614 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 19:05:28,615 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 19:05:28,615 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ef232f94cb2adf03185aed5adfaef3f0eb9593ee06bfb5b3fbb6e4bc1dd6d041 [2024-10-14 19:05:28,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 19:05:28,957 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 19:05:28,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 19:05:28,960 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 19:05:28,961 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 19:05:28,963 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i [2024-10-14 19:05:30,505 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 19:05:30,787 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 19:05:30,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test7-2.i [2024-10-14 19:05:30,811 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03fca9c15/823f246272a347e08250855b7d81a42b/FLAG795fccc31 [2024-10-14 19:05:30,829 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03fca9c15/823f246272a347e08250855b7d81a42b [2024-10-14 19:05:30,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 19:05:30,834 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 19:05:30,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 19:05:30,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 19:05:30,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 19:05:30,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:05:30" (1/1) ... [2024-10-14 19:05:30,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24b19665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:05:30, skipping insertion in model container [2024-10-14 19:05:30,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:05:30" (1/1) ... [2024-10-14 19:05:30,908 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:05:31,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:05:31,460 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-14 19:05:31,473 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 19:05:31,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:05:31,541 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 19:05:31,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 19:05:31,646 INFO L204 MainTranslator]: Completed translation [2024-10-14 19:05:31,646 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:05:31 WrapperNode [2024-10-14 19:05:31,646 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 19:05:31,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 19:05:31,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 19:05:31,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 19:05:31,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:05:31" (1/1) ... [2024-10-14 19:05:31,703 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:05:31" (1/1) ... [2024-10-14 19:05:31,765 INFO L138 Inliner]: procedures = 179, calls = 323, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1204 [2024-10-14 19:05:31,765 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 19:05:31,766 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 19:05:31,766 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 19:05:31,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 19:05:31,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:05:31" (1/1) ... [2024-10-14 19:05:31,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:05:31" (1/1) ... [2024-10-14 19:05:31,809 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:05:31" (1/1) ... [2024-10-14 19:05:31,909 INFO L175 MemorySlicer]: Split 301 memory accesses to 3 slices as follows [2, 265, 34]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 58, 4]. [2024-10-14 19:05:31,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:05:31" (1/1) ... [2024-10-14 19:05:31,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:05:31" (1/1) ... [2024-10-14 19:05:31,950 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:05:31" (1/1) ... [2024-10-14 19:05:31,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:05:31" (1/1) ... [2024-10-14 19:05:31,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:05:31" (1/1) ... [2024-10-14 19:05:31,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:05:31" (1/1) ... [2024-10-14 19:05:31,990 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 19:05:31,991 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 19:05:31,991 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 19:05:31,991 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 19:05:31,992 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:05:31" (1/1) ... [2024-10-14 19:05:31,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 19:05:32,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 19:05:32,023 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 19:05:32,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 19:05:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-14 19:05:32,059 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-14 19:05:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-14 19:05:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-14 19:05:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-14 19:05:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-14 19:05:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-14 19:05:32,059 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-14 19:05:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-14 19:05:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-14 19:05:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-14 19:05:32,060 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-14 19:05:32,060 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-14 19:05:32,060 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-14 19:05:32,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 19:05:32,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 19:05:32,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 19:05:32,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 19:05:32,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 19:05:32,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 19:05:32,061 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 19:05:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 19:05:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 19:05:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 19:05:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-14 19:05:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-14 19:05:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-14 19:05:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 19:05:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 19:05:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-14 19:05:32,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 19:05:32,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 19:05:32,308 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 19:05:32,310 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 19:05:32,330 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:05:32,367 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:05:32,389 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-14 19:05:36,154 INFO L? ?]: Removed 1295 outVars from TransFormulas that were not future-live. [2024-10-14 19:05:36,154 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 19:05:36,318 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 19:05:36,318 INFO L314 CfgBuilder]: Removed 72 assume(true) statements. [2024-10-14 19:05:36,319 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:05:36 BoogieIcfgContainer [2024-10-14 19:05:36,319 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 19:05:36,321 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 19:05:36,321 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 19:05:36,324 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 19:05:36,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:05:30" (1/3) ... [2024-10-14 19:05:36,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544b814d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:05:36, skipping insertion in model container [2024-10-14 19:05:36,325 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:05:31" (2/3) ... [2024-10-14 19:05:36,325 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@544b814d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:05:36, skipping insertion in model container [2024-10-14 19:05:36,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:05:36" (3/3) ... [2024-10-14 19:05:36,328 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test7-2.i [2024-10-14 19:05:36,344 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 19:05:36,345 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 628 error locations. [2024-10-14 19:05:36,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 19:05:36,425 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;@34b07bf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 19:05:36,425 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-10-14 19:05:36,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 1133 states, 500 states have (on average 2.536) internal successors, (1268), 1126 states have internal predecessors, (1268), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-10-14 19:05:36,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 19:05:36,437 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:05:36,438 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 19:05:36,438 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:05:36,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:05:36,444 INFO L85 PathProgramCache]: Analyzing trace with hash 62474, now seen corresponding path program 1 times [2024-10-14 19:05:36,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:05:36,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553671211] [2024-10-14 19:05:36,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:05:36,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:36,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:05:36,458 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:05:36,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 19:05:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:05:36,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:05:36,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:05:36,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:05:36,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:05:36,671 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:05:36,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:05:36,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553671211] [2024-10-14 19:05:36,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553671211] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:05:36,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:05:36,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:05:36,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633069618] [2024-10-14 19:05:36,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:05:36,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:05:36,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:05:36,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:05:36,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:05:36,714 INFO L87 Difference]: Start difference. First operand has 1133 states, 500 states have (on average 2.536) internal successors, (1268), 1126 states have internal predecessors, (1268), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-14 19:05:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:05:38,316 INFO L93 Difference]: Finished difference Result 1289 states and 1365 transitions. [2024-10-14 19:05:38,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:05:38,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-10-14 19:05:38,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:05:38,334 INFO L225 Difference]: With dead ends: 1289 [2024-10-14 19:05:38,334 INFO L226 Difference]: Without dead ends: 1288 [2024-10-14 19:05:38,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-14 19:05:38,339 INFO L432 NwaCegarLoop]: 615 mSDtfsCounter, 1044 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 749 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:05:38,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 749 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 19:05:38,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2024-10-14 19:05:38,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1116. [2024-10-14 19:05:38,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 502 states have (on average 2.3406374501992033) internal successors, (1175), 1110 states have internal predecessors, (1175), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:05:38,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1183 transitions. [2024-10-14 19:05:38,420 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1183 transitions. Word has length 2 [2024-10-14 19:05:38,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:05:38,420 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1183 transitions. [2024-10-14 19:05:38,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-14 19:05:38,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1183 transitions. [2024-10-14 19:05:38,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-14 19:05:38,423 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:05:38,423 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-14 19:05:38,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 19:05:38,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:38,626 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:05:38,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:05:38,626 INFO L85 PathProgramCache]: Analyzing trace with hash 62475, now seen corresponding path program 1 times [2024-10-14 19:05:38,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:05:38,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641323454] [2024-10-14 19:05:38,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:05:38,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:38,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:05:38,629 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:05:38,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 19:05:38,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:05:38,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:05:38,750 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:05:38,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:05:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:05:38,777 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:05:38,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:05:38,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641323454] [2024-10-14 19:05:38,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641323454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:05:38,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:05:38,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-14 19:05:38,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378284034] [2024-10-14 19:05:38,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:05:38,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:05:38,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:05:38,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:05:38,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:05:38,782 INFO L87 Difference]: Start difference. First operand 1116 states and 1183 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-14 19:05:41,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:05:41,269 INFO L93 Difference]: Finished difference Result 1660 states and 1770 transitions. [2024-10-14 19:05:41,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:05:41,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2024-10-14 19:05:41,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:05:41,275 INFO L225 Difference]: With dead ends: 1660 [2024-10-14 19:05:41,275 INFO L226 Difference]: Without dead ends: 1660 [2024-10-14 19:05:41,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-10-14 19:05:41,276 INFO L432 NwaCegarLoop]: 826 mSDtfsCounter, 584 mSDsluCounter, 566 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:05:41,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 1392 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 19:05:41,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2024-10-14 19:05:41,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1289. [2024-10-14 19:05:41,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 676 states have (on average 2.3106508875739644) internal successors, (1562), 1283 states have internal predecessors, (1562), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:05:41,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1570 transitions. [2024-10-14 19:05:41,316 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1570 transitions. Word has length 2 [2024-10-14 19:05:41,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:05:41,316 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1570 transitions. [2024-10-14 19:05:41,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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-10-14 19:05:41,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1570 transitions. [2024-10-14 19:05:41,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 19:05:41,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:05:41,317 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 19:05:41,322 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 19:05:41,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:41,522 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:05:41,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:05:41,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1861944980, now seen corresponding path program 1 times [2024-10-14 19:05:41,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:05:41,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626691308] [2024-10-14 19:05:41,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:05:41,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:41,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:05:41,527 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:05:41,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 19:05:41,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:05:41,688 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 19:05:41,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:05:41,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:05:41,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:05:41,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:05:41,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 19:05:41,795 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:05:41,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-14 19:05:41,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:05:41,822 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:05:41,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:05:41,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626691308] [2024-10-14 19:05:41,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626691308] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:05:41,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:05:41,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:05:41,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574680278] [2024-10-14 19:05:41,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:05:41,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:05:41,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:05:41,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:05:41,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:05:41,827 INFO L87 Difference]: Start difference. First operand 1289 states and 1570 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-10-14 19:05:44,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:05:44,335 INFO L93 Difference]: Finished difference Result 1455 states and 1747 transitions. [2024-10-14 19:05:44,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:05:44,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-10-14 19:05:44,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:05:44,340 INFO L225 Difference]: With dead ends: 1455 [2024-10-14 19:05:44,340 INFO L226 Difference]: Without dead ends: 1455 [2024-10-14 19:05:44,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:05:44,341 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 1322 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1108 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-14 19:05:44,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 379 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1108 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-14 19:05:44,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2024-10-14 19:05:44,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 1104. [2024-10-14 19:05:44,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 502 states have (on average 2.314741035856574) internal successors, (1162), 1098 states have internal predecessors, (1162), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:05:44,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1170 transitions. [2024-10-14 19:05:44,361 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1170 transitions. Word has length 6 [2024-10-14 19:05:44,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:05:44,362 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 1170 transitions. [2024-10-14 19:05:44,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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-10-14 19:05:44,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1170 transitions. [2024-10-14 19:05:44,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 19:05:44,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:05:44,365 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:05:44,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 19:05:44,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:44,566 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:05:44,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:05:44,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1885719534, now seen corresponding path program 1 times [2024-10-14 19:05:44,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:05:44,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069338154] [2024-10-14 19:05:44,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:05:44,567 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:44,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:05:44,570 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:05:44,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 19:05:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:05:44,706 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:05:44,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:05:44,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:05:44,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:05:44,748 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:05:44,749 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:05:44,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069338154] [2024-10-14 19:05:44,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069338154] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:05:44,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:05:44,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:05:44,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683972575] [2024-10-14 19:05:44,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:05:44,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:05:44,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:05:44,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:05:44,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:05:44,751 INFO L87 Difference]: Start difference. First operand 1104 states and 1170 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-10-14 19:05:46,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:05:46,856 INFO L93 Difference]: Finished difference Result 1527 states and 1630 transitions. [2024-10-14 19:05:46,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:05:46,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-10-14 19:05:46,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:05:46,861 INFO L225 Difference]: With dead ends: 1527 [2024-10-14 19:05:46,861 INFO L226 Difference]: Without dead ends: 1527 [2024-10-14 19:05:46,863 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-14 19:05:46,864 INFO L432 NwaCegarLoop]: 1138 mSDtfsCounter, 623 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 19:05:46,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 1566 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 19:05:46,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1527 states. [2024-10-14 19:05:46,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1527 to 1121. [2024-10-14 19:05:46,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 529 states have (on average 2.3062381852551983) internal successors, (1220), 1115 states have internal predecessors, (1220), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:05:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1228 transitions. [2024-10-14 19:05:46,886 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1228 transitions. Word has length 7 [2024-10-14 19:05:46,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:05:46,886 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1228 transitions. [2024-10-14 19:05:46,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-10-14 19:05:46,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1228 transitions. [2024-10-14 19:05:46,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 19:05:46,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:05:46,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:05:46,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-14 19:05:47,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:47,090 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:05:47,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:05:47,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1885719533, now seen corresponding path program 1 times [2024-10-14 19:05:47,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:05:47,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919436737] [2024-10-14 19:05:47,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:05:47,092 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:47,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:05:47,095 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:05:47,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 19:05:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:05:47,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:05:47,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:05:47,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:05:47,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:05:47,231 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:05:47,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:05:47,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919436737] [2024-10-14 19:05:47,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919436737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:05:47,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:05:47,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 19:05:47,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336190077] [2024-10-14 19:05:47,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:05:47,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:05:47,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:05:47,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:05:47,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:05:47,234 INFO L87 Difference]: Start difference. First operand 1121 states and 1228 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-10-14 19:05:48,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:05:48,573 INFO L93 Difference]: Finished difference Result 1422 states and 1555 transitions. [2024-10-14 19:05:48,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:05:48,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-10-14 19:05:48,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:05:48,577 INFO L225 Difference]: With dead ends: 1422 [2024-10-14 19:05:48,577 INFO L226 Difference]: Without dead ends: 1422 [2024-10-14 19:05:48,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-10-14 19:05:48,580 INFO L432 NwaCegarLoop]: 944 mSDtfsCounter, 830 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 19:05:48,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1235 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 19:05:48,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2024-10-14 19:05:48,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1074. [2024-10-14 19:05:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1074 states, 529 states have (on average 2.2098298676748582) internal successors, (1169), 1068 states have internal predecessors, (1169), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:05:48,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 1177 transitions. [2024-10-14 19:05:48,604 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 1177 transitions. Word has length 7 [2024-10-14 19:05:48,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:05:48,605 INFO L471 AbstractCegarLoop]: Abstraction has 1074 states and 1177 transitions. [2024-10-14 19:05:48,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-10-14 19:05:48,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 1177 transitions. [2024-10-14 19:05:48,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 19:05:48,606 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:05:48,606 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:05:48,612 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-10-14 19:05:48,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:48,807 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:05:48,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:05:48,808 INFO L85 PathProgramCache]: Analyzing trace with hash 270035494, now seen corresponding path program 1 times [2024-10-14 19:05:48,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:05:48,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012989514] [2024-10-14 19:05:48,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:05:48,809 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:48,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:05:48,812 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:05:48,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 19:05:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:05:48,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 19:05:48,942 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:05:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:05:49,015 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:05:49,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:05:49,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012989514] [2024-10-14 19:05:49,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012989514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:05:49,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:05:49,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:05:49,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225347779] [2024-10-14 19:05:49,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:05:49,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:05:49,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:05:49,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:05:49,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:05:49,018 INFO L87 Difference]: Start difference. First operand 1074 states and 1177 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:05:50,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:05:50,292 INFO L93 Difference]: Finished difference Result 1611 states and 1798 transitions. [2024-10-14 19:05:50,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:05:50,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 12 [2024-10-14 19:05:50,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:05:50,297 INFO L225 Difference]: With dead ends: 1611 [2024-10-14 19:05:50,297 INFO L226 Difference]: Without dead ends: 1611 [2024-10-14 19:05:50,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:05:50,298 INFO L432 NwaCegarLoop]: 1084 mSDtfsCounter, 572 mSDsluCounter, 1866 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 2950 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 19:05:50,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 2950 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 19:05:50,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1611 states. [2024-10-14 19:05:50,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1611 to 1278. [2024-10-14 19:05:50,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 733 states have (on average 2.1664392905866303) internal successors, (1588), 1272 states have internal predecessors, (1588), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:05:50,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1596 transitions. [2024-10-14 19:05:50,317 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1596 transitions. Word has length 12 [2024-10-14 19:05:50,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:05:50,318 INFO L471 AbstractCegarLoop]: Abstraction has 1278 states and 1596 transitions. [2024-10-14 19:05:50,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:05:50,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1596 transitions. [2024-10-14 19:05:50,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 19:05:50,318 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:05:50,319 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:05:50,323 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-14 19:05:50,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:50,519 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:05:50,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:05:50,520 INFO L85 PathProgramCache]: Analyzing trace with hash -322964451, now seen corresponding path program 1 times [2024-10-14 19:05:50,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:05:50,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475287631] [2024-10-14 19:05:50,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:05:50,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:50,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:05:50,521 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:05:50,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-14 19:05:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:05:50,655 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:05:50,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:05:50,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:05:50,662 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:05:50,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:05:50,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475287631] [2024-10-14 19:05:50,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475287631] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:05:50,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:05:50,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:05:50,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173515405] [2024-10-14 19:05:50,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:05:50,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:05:50,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:05:50,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:05:50,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:05:50,664 INFO L87 Difference]: Start difference. First operand 1278 states and 1596 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-14 19:05:51,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:05:51,134 INFO L93 Difference]: Finished difference Result 1224 states and 1516 transitions. [2024-10-14 19:05:51,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:05:51,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2024-10-14 19:05:51,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:05:51,138 INFO L225 Difference]: With dead ends: 1224 [2024-10-14 19:05:51,138 INFO L226 Difference]: Without dead ends: 1224 [2024-10-14 19:05:51,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-10-14 19:05:51,139 INFO L432 NwaCegarLoop]: 938 mSDtfsCounter, 61 mSDsluCounter, 896 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1834 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:05:51,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1834 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 19:05:51,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2024-10-14 19:05:51,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1224. [2024-10-14 19:05:51,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 703 states have (on average 2.1450924608819344) internal successors, (1508), 1218 states have internal predecessors, (1508), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:05:51,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1516 transitions. [2024-10-14 19:05:51,156 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1516 transitions. Word has length 12 [2024-10-14 19:05:51,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:05:51,156 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1516 transitions. [2024-10-14 19:05:51,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-14 19:05:51,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1516 transitions. [2024-10-14 19:05:51,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-14 19:05:51,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:05:51,157 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:05:51,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-10-14 19:05:51,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:51,358 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr354REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:05:51,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:05:51,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1131166537, now seen corresponding path program 1 times [2024-10-14 19:05:51,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:05:51,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238131464] [2024-10-14 19:05:51,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:05:51,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:51,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:05:51,362 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:05:51,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-14 19:05:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:05:51,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:05:51,477 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:05:51,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:05:51,497 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:05:51,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:05:51,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238131464] [2024-10-14 19:05:51,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238131464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:05:51,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:05:51,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:05:51,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478803358] [2024-10-14 19:05:51,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:05:51,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:05:51,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:05:51,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:05:51,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:05:51,499 INFO L87 Difference]: Start difference. First operand 1224 states and 1516 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:05:52,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:05:52,167 INFO L93 Difference]: Finished difference Result 1208 states and 1472 transitions. [2024-10-14 19:05:52,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:05:52,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-14 19:05:52,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:05:52,171 INFO L225 Difference]: With dead ends: 1208 [2024-10-14 19:05:52,171 INFO L226 Difference]: Without dead ends: 1208 [2024-10-14 19:05:52,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:05:52,172 INFO L432 NwaCegarLoop]: 907 mSDtfsCounter, 45 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2703 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:05:52,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2703 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 19:05:52,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2024-10-14 19:05:52,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1208. [2024-10-14 19:05:52,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1208 states, 701 states have (on average 2.0884450784593436) internal successors, (1464), 1202 states have internal predecessors, (1464), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:05:52,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1472 transitions. [2024-10-14 19:05:52,190 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1472 transitions. Word has length 14 [2024-10-14 19:05:52,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:05:52,190 INFO L471 AbstractCegarLoop]: Abstraction has 1208 states and 1472 transitions. [2024-10-14 19:05:52,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 19:05:52,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1472 transitions. [2024-10-14 19:05:52,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 19:05:52,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:05:52,191 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:05:52,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-10-14 19:05:52,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:52,392 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr626ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:05:52,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:05:52,393 INFO L85 PathProgramCache]: Analyzing trace with hash -371880063, now seen corresponding path program 1 times [2024-10-14 19:05:52,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:05:52,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84677706] [2024-10-14 19:05:52,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:05:52,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:52,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:05:52,395 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:05:52,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-14 19:05:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:05:52,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:05:52,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:05:52,547 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:05:52,548 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:05:52,550 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-10-14 19:05:52,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 19:05:52,589 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-10-14 19:05:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:05:52,623 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:05:52,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:05:52,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84677706] [2024-10-14 19:05:52,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84677706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:05:52,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:05:52,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:05:52,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334703935] [2024-10-14 19:05:52,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:05:52,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:05:52,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:05:52,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:05:52,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:05:52,624 INFO L87 Difference]: Start difference. First operand 1208 states and 1472 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-10-14 19:05:53,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:05:53,955 INFO L93 Difference]: Finished difference Result 2148 states and 2510 transitions. [2024-10-14 19:05:53,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:05:53,955 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-10-14 19:05:53,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:05:53,959 INFO L225 Difference]: With dead ends: 2148 [2024-10-14 19:05:53,959 INFO L226 Difference]: Without dead ends: 2148 [2024-10-14 19:05:53,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:05:53,961 INFO L432 NwaCegarLoop]: 917 mSDtfsCounter, 979 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 982 SdHoareTripleChecker+Valid, 2744 SdHoareTripleChecker+Invalid, 366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 19:05:53,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [982 Valid, 2744 Invalid, 366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 19:05:53,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2148 states. [2024-10-14 19:05:53,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2148 to 1207. [2024-10-14 19:05:53,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1207 states, 700 states have (on average 2.0885714285714285) internal successors, (1462), 1201 states have internal predecessors, (1462), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:05:53,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 1470 transitions. [2024-10-14 19:05:53,981 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 1470 transitions. Word has length 15 [2024-10-14 19:05:53,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:05:53,982 INFO L471 AbstractCegarLoop]: Abstraction has 1207 states and 1470 transitions. [2024-10-14 19:05:53,982 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-10-14 19:05:53,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 1470 transitions. [2024-10-14 19:05:53,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 19:05:53,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:05:53,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:05:53,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-14 19:05:54,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:54,183 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:05:54,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:05:54,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1679153540, now seen corresponding path program 1 times [2024-10-14 19:05:54,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:05:54,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433679708] [2024-10-14 19:05:54,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:05:54,184 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:54,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:05:54,187 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:05:54,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-14 19:05:54,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:05:54,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-14 19:05:54,354 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:05:54,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:05:54,364 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:05:54,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:05:54,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433679708] [2024-10-14 19:05:54,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433679708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:05:54,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:05:54,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:05:54,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237954593] [2024-10-14 19:05:54,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:05:54,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 19:05:54,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:05:54,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 19:05:54,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 19:05:54,366 INFO L87 Difference]: Start difference. First operand 1207 states and 1470 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-10-14 19:05:54,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:05:54,931 INFO L93 Difference]: Finished difference Result 1153 states and 1390 transitions. [2024-10-14 19:05:54,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 19:05:54,932 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-10-14 19:05:54,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:05:54,935 INFO L225 Difference]: With dead ends: 1153 [2024-10-14 19:05:54,935 INFO L226 Difference]: Without dead ends: 1153 [2024-10-14 19:05:54,935 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-10-14 19:05:54,936 INFO L432 NwaCegarLoop]: 880 mSDtfsCounter, 61 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1718 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:05:54,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1718 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 19:05:54,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-10-14 19:05:54,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1153. [2024-10-14 19:05:54,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 670 states have (on average 2.062686567164179) internal successors, (1382), 1147 states have internal predecessors, (1382), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:05:54,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1390 transitions. [2024-10-14 19:05:54,951 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1390 transitions. Word has length 15 [2024-10-14 19:05:54,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:05:54,951 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1390 transitions. [2024-10-14 19:05:54,951 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-10-14 19:05:54,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1390 transitions. [2024-10-14 19:05:54,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 19:05:54,952 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:05:54,952 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:05:54,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-14 19:05:55,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:55,153 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:05:55,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:05:55,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1241154114, now seen corresponding path program 1 times [2024-10-14 19:05:55,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:05:55,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323499204] [2024-10-14 19:05:55,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:05:55,154 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:55,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:05:55,157 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:05:55,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-14 19:05:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:05:55,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:05:55,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:05:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:05:55,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:05:55,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:05:55,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323499204] [2024-10-14 19:05:55,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323499204] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:05:55,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:05:55,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:05:55,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072744309] [2024-10-14 19:05:55,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:05:55,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:05:55,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:05:55,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:05:55,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:05:55,357 INFO L87 Difference]: Start difference. First operand 1153 states and 1390 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-10-14 19:05:55,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:05:55,944 INFO L93 Difference]: Finished difference Result 1137 states and 1346 transitions. [2024-10-14 19:05:55,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:05:55,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2024-10-14 19:05:55,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:05:55,948 INFO L225 Difference]: With dead ends: 1137 [2024-10-14 19:05:55,948 INFO L226 Difference]: Without dead ends: 1137 [2024-10-14 19:05:55,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:05:55,948 INFO L432 NwaCegarLoop]: 849 mSDtfsCounter, 45 mSDsluCounter, 1680 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2529 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:05:55,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2529 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 19:05:55,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2024-10-14 19:05:55,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1137. [2024-10-14 19:05:55,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 668 states have (on average 2.002994011976048) internal successors, (1338), 1131 states have internal predecessors, (1338), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:05:55,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1346 transitions. [2024-10-14 19:05:55,962 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1346 transitions. Word has length 17 [2024-10-14 19:05:55,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:05:55,962 INFO L471 AbstractCegarLoop]: Abstraction has 1137 states and 1346 transitions. [2024-10-14 19:05:55,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-10-14 19:05:55,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1346 transitions. [2024-10-14 19:05:55,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 19:05:55,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:05:55,963 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:05:55,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-14 19:05:56,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:56,168 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:05:56,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:05:56,168 INFO L85 PathProgramCache]: Analyzing trace with hash -77809332, now seen corresponding path program 1 times [2024-10-14 19:05:56,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:05:56,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088628437] [2024-10-14 19:05:56,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:05:56,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:56,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:05:56,170 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:05:56,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-14 19:05:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:05:56,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:05:56,331 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:05:56,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:05:56,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:05:56,404 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:05:56,405 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:05:56,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088628437] [2024-10-14 19:05:56,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088628437] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:05:56,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:05:56,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:05:56,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184699197] [2024-10-14 19:05:56,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:05:56,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:05:56,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:05:56,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:05:56,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:05:56,407 INFO L87 Difference]: Start difference. First operand 1137 states and 1346 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-10-14 19:05:57,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:05:57,949 INFO L93 Difference]: Finished difference Result 1495 states and 1817 transitions. [2024-10-14 19:05:57,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:05:57,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2024-10-14 19:05:57,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:05:57,953 INFO L225 Difference]: With dead ends: 1495 [2024-10-14 19:05:57,953 INFO L226 Difference]: Without dead ends: 1495 [2024-10-14 19:05:57,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:05:57,954 INFO L432 NwaCegarLoop]: 546 mSDtfsCounter, 704 mSDsluCounter, 672 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:05:57,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1218 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 19:05:57,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2024-10-14 19:05:57,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1133. [2024-10-14 19:05:57,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 668 states have (on average 1.9910179640718564) internal successors, (1330), 1127 states have internal predecessors, (1330), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:05:57,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1338 transitions. [2024-10-14 19:05:57,978 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1338 transitions. Word has length 31 [2024-10-14 19:05:57,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:05:57,978 INFO L471 AbstractCegarLoop]: Abstraction has 1133 states and 1338 transitions. [2024-10-14 19:05:57,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-10-14 19:05:57,979 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1338 transitions. [2024-10-14 19:05:57,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 19:05:57,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:05:57,979 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:05:57,985 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-14 19:05:58,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:58,184 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:05:58,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:05:58,184 INFO L85 PathProgramCache]: Analyzing trace with hash -77809331, now seen corresponding path program 1 times [2024-10-14 19:05:58,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:05:58,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207366530] [2024-10-14 19:05:58,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:05:58,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:05:58,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:05:58,188 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:05:58,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-14 19:05:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:05:58,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:05:58,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:05:58,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:05:58,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:05:58,486 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:05:58,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:05:58,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207366530] [2024-10-14 19:05:58,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207366530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:05:58,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:05:58,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:05:58,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633244767] [2024-10-14 19:05:58,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:05:58,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:05:58,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:05:58,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:05:58,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:05:58,488 INFO L87 Difference]: Start difference. First operand 1133 states and 1338 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-10-14 19:06:00,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:00,759 INFO L93 Difference]: Finished difference Result 1601 states and 1900 transitions. [2024-10-14 19:06:00,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:06:00,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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 31 [2024-10-14 19:06:00,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:00,764 INFO L225 Difference]: With dead ends: 1601 [2024-10-14 19:06:00,764 INFO L226 Difference]: Without dead ends: 1601 [2024-10-14 19:06:00,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:06:00,765 INFO L432 NwaCegarLoop]: 1046 mSDtfsCounter, 493 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 1475 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 2088 SdHoareTripleChecker+Invalid, 1478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:00,765 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [493 Valid, 2088 Invalid, 1478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1475 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 19:06:00,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2024-10-14 19:06:00,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1129. [2024-10-14 19:06:00,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 668 states have (on average 1.9790419161676647) internal successors, (1322), 1123 states have internal predecessors, (1322), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:00,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1330 transitions. [2024-10-14 19:06:00,787 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1330 transitions. Word has length 31 [2024-10-14 19:06:00,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:00,787 INFO L471 AbstractCegarLoop]: Abstraction has 1129 states and 1330 transitions. [2024-10-14 19:06:00,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 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-10-14 19:06:00,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1330 transitions. [2024-10-14 19:06:00,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-10-14 19:06:00,791 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:00,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:00,798 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-10-14 19:06:00,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:06:00,992 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:06:00,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:00,993 INFO L85 PathProgramCache]: Analyzing trace with hash 45408380, now seen corresponding path program 1 times [2024-10-14 19:06:00,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:00,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780897676] [2024-10-14 19:06:00,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:00,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:06:00,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:00,996 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:06:00,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-14 19:06:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:01,204 INFO L255 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:06:01,207 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:01,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:01,247 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:01,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:01,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780897676] [2024-10-14 19:06:01,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780897676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:01,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:01,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:06:01,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896384300] [2024-10-14 19:06:01,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:01,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:06:01,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:01,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:06:01,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:06:01,249 INFO L87 Difference]: Start difference. First operand 1129 states and 1330 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-10-14 19:06:01,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:01,828 INFO L93 Difference]: Finished difference Result 1117 states and 1310 transitions. [2024-10-14 19:06:01,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 19:06:01,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 50 [2024-10-14 19:06:01,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:01,831 INFO L225 Difference]: With dead ends: 1117 [2024-10-14 19:06:01,831 INFO L226 Difference]: Without dead ends: 1117 [2024-10-14 19:06:01,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:06:01,832 INFO L432 NwaCegarLoop]: 843 mSDtfsCounter, 15 mSDsluCounter, 1669 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2512 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:01,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2512 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 19:06:01,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2024-10-14 19:06:01,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1117. [2024-10-14 19:06:01,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 656 states have (on average 1.9847560975609757) internal successors, (1302), 1111 states have internal predecessors, (1302), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:01,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1310 transitions. [2024-10-14 19:06:01,844 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1310 transitions. Word has length 50 [2024-10-14 19:06:01,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:01,846 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1310 transitions. [2024-10-14 19:06:01,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-10-14 19:06:01,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1310 transitions. [2024-10-14 19:06:01,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 19:06:01,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:01,848 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:01,855 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 (15)] Forceful destruction successful, exit code 0 [2024-10-14 19:06:02,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:06:02,049 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:06:02,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:02,049 INFO L85 PathProgramCache]: Analyzing trace with hash -692970853, now seen corresponding path program 1 times [2024-10-14 19:06:02,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:02,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [750706242] [2024-10-14 19:06:02,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:02,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:06:02,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:02,051 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:06:02,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-14 19:06:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:02,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 19:06:02,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:02,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:06:02,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:06:02,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 19:06:02,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-14 19:06:02,824 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-14 19:06:02,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-14 19:06:02,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:02,837 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:02,837 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:02,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [750706242] [2024-10-14 19:06:02,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [750706242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:02,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:02,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 19:06:02,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031702136] [2024-10-14 19:06:02,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:02,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:06:02,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:02,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:06:02,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:06:02,839 INFO L87 Difference]: Start difference. First operand 1117 states and 1310 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 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-10-14 19:06:04,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:04,643 INFO L93 Difference]: Finished difference Result 1433 states and 1743 transitions. [2024-10-14 19:06:04,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:06:04,643 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 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 54 [2024-10-14 19:06:04,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:04,646 INFO L225 Difference]: With dead ends: 1433 [2024-10-14 19:06:04,646 INFO L226 Difference]: Without dead ends: 1433 [2024-10-14 19:06:04,647 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:06:04,647 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 954 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:04,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 620 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1053 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-14 19:06:04,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2024-10-14 19:06:04,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1052. [2024-10-14 19:06:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 629 states have (on average 1.9077901430842608) internal successors, (1200), 1046 states have internal predecessors, (1200), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:04,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1208 transitions. [2024-10-14 19:06:04,658 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1208 transitions. Word has length 54 [2024-10-14 19:06:04,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:04,658 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1208 transitions. [2024-10-14 19:06:04,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 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-10-14 19:06:04,659 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1208 transitions. [2024-10-14 19:06:04,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 19:06:04,660 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:04,660 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:04,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-14 19:06:04,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:06:04,861 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:06:04,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:04,861 INFO L85 PathProgramCache]: Analyzing trace with hash 26610228, now seen corresponding path program 1 times [2024-10-14 19:06:04,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:04,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2036210420] [2024-10-14 19:06:04,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:04,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:06:04,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:04,863 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:06:04,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-14 19:06:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:05,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 19:06:05,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:05,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:06:05,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 19:06:05,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 19:06:05,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:05,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:05,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:05,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2036210420] [2024-10-14 19:06:05,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2036210420] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:05,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:05,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:06:05,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729223105] [2024-10-14 19:06:05,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:05,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:06:05,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:05,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:06:05,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:06:05,193 INFO L87 Difference]: Start difference. First operand 1052 states and 1208 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-10-14 19:06:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:06,897 INFO L93 Difference]: Finished difference Result 1051 states and 1207 transitions. [2024-10-14 19:06:06,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:06:06,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2024-10-14 19:06:06,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:06,900 INFO L225 Difference]: With dead ends: 1051 [2024-10-14 19:06:06,900 INFO L226 Difference]: Without dead ends: 1051 [2024-10-14 19:06:06,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:06:06,900 INFO L432 NwaCegarLoop]: 817 mSDtfsCounter, 2 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 1553 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2111 SdHoareTripleChecker+Invalid, 1554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:06,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2111 Invalid, 1554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1553 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-14 19:06:06,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1051 states. [2024-10-14 19:06:06,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1051 to 1051. [2024-10-14 19:06:06,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1051 states, 629 states have (on average 1.9062003179650238) internal successors, (1199), 1045 states have internal predecessors, (1199), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:06,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1207 transitions. [2024-10-14 19:06:06,911 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1207 transitions. Word has length 58 [2024-10-14 19:06:06,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:06,912 INFO L471 AbstractCegarLoop]: Abstraction has 1051 states and 1207 transitions. [2024-10-14 19:06:06,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-10-14 19:06:06,912 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1207 transitions. [2024-10-14 19:06:06,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-14 19:06:06,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:06,913 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:06,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-14 19:06:07,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:06:07,114 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:06:07,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:07,114 INFO L85 PathProgramCache]: Analyzing trace with hash 26610229, now seen corresponding path program 1 times [2024-10-14 19:06:07,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:07,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120521477] [2024-10-14 19:06:07,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:07,115 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:06:07,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:07,117 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:06:07,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-14 19:06:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:07,340 INFO L255 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 19:06:07,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:07,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:06:07,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 19:06:07,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-14 19:06:07,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-14 19:06:07,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:07,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:07,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:07,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120521477] [2024-10-14 19:06:07,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120521477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:07,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:07,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:06:07,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008641358] [2024-10-14 19:06:07,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:07,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 19:06:07,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:07,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 19:06:07,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 19:06:07,449 INFO L87 Difference]: Start difference. First operand 1051 states and 1207 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-10-14 19:06:09,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:09,745 INFO L93 Difference]: Finished difference Result 1050 states and 1206 transitions. [2024-10-14 19:06:09,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 19:06:09,746 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2024-10-14 19:06:09,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:09,748 INFO L225 Difference]: With dead ends: 1050 [2024-10-14 19:06:09,748 INFO L226 Difference]: Without dead ends: 1050 [2024-10-14 19:06:09,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 19:06:09,749 INFO L432 NwaCegarLoop]: 817 mSDtfsCounter, 1 mSDsluCounter, 1346 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2163 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:09,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2163 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 19:06:09,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2024-10-14 19:06:09,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1050. [2024-10-14 19:06:09,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 628 states have (on average 1.9076433121019107) internal successors, (1198), 1044 states have internal predecessors, (1198), 5 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-14 19:06:09,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 1206 transitions. [2024-10-14 19:06:09,759 INFO L78 Accepts]: Start accepts. Automaton has 1050 states and 1206 transitions. Word has length 58 [2024-10-14 19:06:09,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:09,759 INFO L471 AbstractCegarLoop]: Abstraction has 1050 states and 1206 transitions. [2024-10-14 19:06:09,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-10-14 19:06:09,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1050 states and 1206 transitions. [2024-10-14 19:06:09,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 19:06:09,759 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:09,760 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:09,766 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 (18)] Forceful destruction successful, exit code 0 [2024-10-14 19:06:09,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:06:09,960 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:06:09,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:09,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1411906232, now seen corresponding path program 1 times [2024-10-14 19:06:09,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:09,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004341505] [2024-10-14 19:06:09,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:09,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-10-14 19:06:09,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:09,963 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:06:09,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-14 19:06:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:10,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 19:06:10,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:10,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:10,226 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 19:06:10,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:10,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004341505] [2024-10-14 19:06:10,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2004341505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 19:06:10,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 19:06:10,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 19:06:10,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218519550] [2024-10-14 19:06:10,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 19:06:10,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 19:06:10,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:10,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 19:06:10,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:06:10,231 INFO L87 Difference]: Start difference. First operand 1050 states and 1206 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 19:06:10,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:10,828 INFO L93 Difference]: Finished difference Result 1052 states and 1209 transitions. [2024-10-14 19:06:10,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 19:06:10,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2024-10-14 19:06:10,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:10,834 INFO L225 Difference]: With dead ends: 1052 [2024-10-14 19:06:10,834 INFO L226 Difference]: Without dead ends: 1052 [2024-10-14 19:06:10,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 19:06:10,836 INFO L432 NwaCegarLoop]: 817 mSDtfsCounter, 0 mSDsluCounter, 1631 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2448 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:10,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2448 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 19:06:10,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2024-10-14 19:06:10,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2024-10-14 19:06:10,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 629 states have (on average 1.9077901430842608) internal successors, (1200), 1046 states have internal predecessors, (1200), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:06:10,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1209 transitions. [2024-10-14 19:06:10,865 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1209 transitions. Word has length 64 [2024-10-14 19:06:10,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:10,866 INFO L471 AbstractCegarLoop]: Abstraction has 1052 states and 1209 transitions. [2024-10-14 19:06:10,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-14 19:06:10,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1209 transitions. [2024-10-14 19:06:10,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 19:06:10,867 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:10,867 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:10,877 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 (19)] Forceful destruction successful, exit code 0 [2024-10-14 19:06:11,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:06:11,067 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:06:11,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:11,068 INFO L85 PathProgramCache]: Analyzing trace with hash 511692994, now seen corresponding path program 1 times [2024-10-14 19:06:11,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:11,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279292856] [2024-10-14 19:06:11,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 19:06:11,069 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:06:11,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:11,070 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:06:11,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-14 19:06:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 19:06:11,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 19:06:11,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:11,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:11,405 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:06:11,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:11,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:11,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279292856] [2024-10-14 19:06:11,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1279292856] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:06:11,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:06:11,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-14 19:06:11,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580507304] [2024-10-14 19:06:11,471 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:06:11,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 19:06:11,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:11,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 19:06:11,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 19:06:11,474 INFO L87 Difference]: Start difference. First operand 1052 states and 1209 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:06:12,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:12,213 INFO L93 Difference]: Finished difference Result 1061 states and 1223 transitions. [2024-10-14 19:06:12,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 19:06:12,215 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2024-10-14 19:06:12,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:12,218 INFO L225 Difference]: With dead ends: 1061 [2024-10-14 19:06:12,218 INFO L226 Difference]: Without dead ends: 1061 [2024-10-14 19:06:12,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-14 19:06:12,219 INFO L432 NwaCegarLoop]: 816 mSDtfsCounter, 4 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2446 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:12,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2446 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 19:06:12,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1061 states. [2024-10-14 19:06:12,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1061 to 1060. [2024-10-14 19:06:12,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1060 states, 636 states have (on average 1.9072327044025157) internal successors, (1213), 1053 states have internal predecessors, (1213), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:06:12,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1222 transitions. [2024-10-14 19:06:12,240 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1222 transitions. Word has length 65 [2024-10-14 19:06:12,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:12,240 INFO L471 AbstractCegarLoop]: Abstraction has 1060 states and 1222 transitions. [2024-10-14 19:06:12,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:06:12,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1222 transitions. [2024-10-14 19:06:12,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 19:06:12,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:12,242 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:12,250 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 (20)] Forceful destruction successful, exit code 0 [2024-10-14 19:06:12,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:06:12,442 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:06:12,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:12,443 INFO L85 PathProgramCache]: Analyzing trace with hash 376581432, now seen corresponding path program 2 times [2024-10-14 19:06:12,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:12,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906745085] [2024-10-14 19:06:12,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 19:06:12,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:06:12,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:12,445 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:06:12,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-14 19:06:12,853 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 19:06:12,853 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:06:12,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 19:06:12,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:12,909 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:12,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:06:13,042 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:13,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:13,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906745085] [2024-10-14 19:06:13,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906745085] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:06:13,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:06:13,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-14 19:06:13,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941937497] [2024-10-14 19:06:13,042 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:06:13,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 19:06:13,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:13,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 19:06:13,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-14 19:06:13,045 INFO L87 Difference]: Start difference. First operand 1060 states and 1222 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:06:14,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:14,381 INFO L93 Difference]: Finished difference Result 1072 states and 1241 transitions. [2024-10-14 19:06:14,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 19:06:14,382 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2024-10-14 19:06:14,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:14,385 INFO L225 Difference]: With dead ends: 1072 [2024-10-14 19:06:14,385 INFO L226 Difference]: Without dead ends: 1070 [2024-10-14 19:06:14,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-14 19:06:14,385 INFO L432 NwaCegarLoop]: 816 mSDtfsCounter, 8 mSDsluCounter, 4075 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4891 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:14,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4891 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-14 19:06:14,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2024-10-14 19:06:14,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1069. [2024-10-14 19:06:14,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1069 states, 645 states have (on average 1.8992248062015504) internal successors, (1225), 1062 states have internal predecessors, (1225), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:06:14,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1234 transitions. [2024-10-14 19:06:14,400 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1234 transitions. Word has length 68 [2024-10-14 19:06:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:14,401 INFO L471 AbstractCegarLoop]: Abstraction has 1069 states and 1234 transitions. [2024-10-14 19:06:14,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:06:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1234 transitions. [2024-10-14 19:06:14,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-14 19:06:14,404 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:14,404 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:14,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-10-14 19:06:14,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:06:14,606 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:06:14,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:14,606 INFO L85 PathProgramCache]: Analyzing trace with hash -987455240, now seen corresponding path program 3 times [2024-10-14 19:06:14,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:14,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1144695531] [2024-10-14 19:06:14,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 19:06:14,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:06:14,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:14,608 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:06:14,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-14 19:06:15,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-14 19:06:15,191 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:06:15,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 19:06:15,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:15,314 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:15,315 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:06:15,723 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:15,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:15,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1144695531] [2024-10-14 19:06:15,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1144695531] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:06:15,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:06:15,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-14 19:06:15,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580654685] [2024-10-14 19:06:15,724 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:06:15,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-14 19:06:15,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:15,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-14 19:06:15,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-14 19:06:15,726 INFO L87 Difference]: Start difference. First operand 1069 states and 1234 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:06:19,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:19,260 INFO L93 Difference]: Finished difference Result 1090 states and 1270 transitions. [2024-10-14 19:06:19,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-14 19:06:19,260 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2024-10-14 19:06:19,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:19,263 INFO L225 Difference]: With dead ends: 1090 [2024-10-14 19:06:19,263 INFO L226 Difference]: Without dead ends: 1087 [2024-10-14 19:06:19,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-14 19:06:19,264 INFO L432 NwaCegarLoop]: 816 mSDtfsCounter, 14 mSDsluCounter, 9777 mSDsCounter, 0 mSdLazyCounter, 1807 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 10593 SdHoareTripleChecker+Invalid, 1822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:19,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 10593 Invalid, 1822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1807 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-10-14 19:06:19,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1087 states. [2024-10-14 19:06:19,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1087 to 1087. [2024-10-14 19:06:19,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1087 states, 663 states have (on average 1.8823529411764706) internal successors, (1248), 1080 states have internal predecessors, (1248), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:06:19,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1087 states to 1087 states and 1257 transitions. [2024-10-14 19:06:19,278 INFO L78 Accepts]: Start accepts. Automaton has 1087 states and 1257 transitions. Word has length 74 [2024-10-14 19:06:19,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:19,278 INFO L471 AbstractCegarLoop]: Abstraction has 1087 states and 1257 transitions. [2024-10-14 19:06:19,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:06:19,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1087 states and 1257 transitions. [2024-10-14 19:06:19,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-14 19:06:19,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:19,279 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:19,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-10-14 19:06:19,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:06:19,480 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:06:19,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:19,480 INFO L85 PathProgramCache]: Analyzing trace with hash 830740600, now seen corresponding path program 4 times [2024-10-14 19:06:19,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:19,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474121081] [2024-10-14 19:06:19,482 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 19:06:19,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:06:19,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:19,485 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:06:19,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-10-14 19:06:19,964 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 19:06:19,964 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:06:19,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 19:06:19,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:20,291 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:20,291 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:06:21,437 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 19:06:21,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:21,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474121081] [2024-10-14 19:06:21,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474121081] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 19:06:21,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 19:06:21,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-14 19:06:21,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717861082] [2024-10-14 19:06:21,438 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 19:06:21,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-14 19:06:21,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 19:06:21,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-14 19:06:21,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-14 19:06:21,441 INFO L87 Difference]: Start difference. First operand 1087 states and 1257 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:06:29,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 19:06:29,690 INFO L93 Difference]: Finished difference Result 1124 states and 1326 transitions. [2024-10-14 19:06:29,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-14 19:06:29,691 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2024-10-14 19:06:29,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 19:06:29,694 INFO L225 Difference]: With dead ends: 1124 [2024-10-14 19:06:29,694 INFO L226 Difference]: Without dead ends: 1122 [2024-10-14 19:06:29,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-14 19:06:29,696 INFO L432 NwaCegarLoop]: 816 mSDtfsCounter, 25 mSDsluCounter, 18745 mSDsCounter, 0 mSdLazyCounter, 4200 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 19561 SdHoareTripleChecker+Invalid, 4234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 4200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-14 19:06:29,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 19561 Invalid, 4234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 4200 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-14 19:06:29,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1122 states. [2024-10-14 19:06:29,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1122 to 1121. [2024-10-14 19:06:29,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1121 states, 697 states have (on average 1.8565279770444763) internal successors, (1294), 1114 states have internal predecessors, (1294), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-10-14 19:06:29,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1121 states to 1121 states and 1303 transitions. [2024-10-14 19:06:29,709 INFO L78 Accepts]: Start accepts. Automaton has 1121 states and 1303 transitions. Word has length 86 [2024-10-14 19:06:29,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 19:06:29,709 INFO L471 AbstractCegarLoop]: Abstraction has 1121 states and 1303 transitions. [2024-10-14 19:06:29,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-14 19:06:29,709 INFO L276 IsEmpty]: Start isEmpty. Operand 1121 states and 1303 transitions. [2024-10-14 19:06:29,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 19:06:29,710 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 19:06:29,710 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 19:06:29,721 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-10-14 19:06:29,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:06:29,911 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-10-14 19:06:29,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 19:06:29,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1519425992, now seen corresponding path program 5 times [2024-10-14 19:06:29,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 19:06:29,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82681146] [2024-10-14 19:06:29,912 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 19:06:29,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 19:06:29,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 19:06:29,913 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 19:06:29,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-10-14 19:06:31,052 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-14 19:06:31,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:06:31,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-14 19:06:31,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:31,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:06:31,190 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-14 19:06:31,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-14 19:06:31,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-14 19:06:31,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-10-14 19:06:32,115 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-14 19:06:32,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-10-14 19:06:32,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-10-14 19:06:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-14 19:06:32,189 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 19:06:32,468 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2023 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem34#1.base| v_ArrVal_2023) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (_ bv0 1))) is different from false [2024-10-14 19:06:32,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 19:06:32,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82681146] [2024-10-14 19:06:32,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82681146] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 19:06:32,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [68099684] [2024-10-14 19:06:32,470 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 19:06:32,470 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 19:06:32,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 19:06:32,472 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 19:06:32,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2024-10-14 19:06:33,008 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-14 19:06:33,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 19:06:33,057 WARN L253 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 615 conjuncts are in the unsatisfiable core [2024-10-14 19:06:33,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 19:06:33,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 19:06:33,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-14 19:06:33,135 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:06:33,136 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:06:33,136 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:06:33,137 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-10-14 19:06:33,205 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2024-10-14 19:06:33,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2024-10-14 19:06:33,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-14 19:06:33,432 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 36 treesize of output 1 [2024-10-14 19:06:33,449 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 8 treesize of output 1 [2024-10-14 19:06:33,459 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:06:33,461 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:06:33,461 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:06:33,462 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 112 treesize of output 121 [2024-10-14 19:06:33,767 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 0 case distinctions, treesize of input 203 treesize of output 91 [2024-10-14 19:06:33,874 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:06:33,875 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:06:33,875 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 19:06:33,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 28 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 185 treesize of output 205 [2024-10-14 19:06:33,903 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 8 treesize of output 1 [2024-10-14 19:06:50,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 66 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 149885 treesize of output 118989 [2024-10-14 19:06:50,739 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 8 treesize of output 1