./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_OAT_nondet_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 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_OAT_nondet_test3-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 be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 17:02:38,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:02:38,853 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 17:02:38,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:02:38,861 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:02:38,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:02:38,896 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:02:38,896 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:02:38,897 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:02:38,897 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:02:38,898 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:02:38,898 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:02:38,899 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:02:38,899 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:02:38,901 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:02:38,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:02:38,902 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:02:38,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:02:38,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:02:38,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:02:38,906 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 17:02:38,906 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 17:02:38,906 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 17:02:38,907 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:02:38,907 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 17:02:38,907 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:02:38,907 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:02:38,908 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:02:38,908 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:02:38,908 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:02:38,909 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:02:38,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:02:38,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:02:38,909 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:02:38,910 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:02:38,910 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:02:38,914 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 17:02:38,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 17:02:38,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:02:38,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:02:38,915 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:02:38,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:02:38,916 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 -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2024-11-20 17:02:39,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:02:39,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:02:39,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:02:39,224 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:02:39,224 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:02:39,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i [2024-11-20 17:02:40,721 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:02:41,029 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:02:41,030 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i [2024-11-20 17:02:41,054 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da85e48c9/41bb999f3804489a8b0bef8a2b040192/FLAG037d2e063 [2024-11-20 17:02:41,067 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da85e48c9/41bb999f3804489a8b0bef8a2b040192 [2024-11-20 17:02:41,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:02:41,071 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:02:41,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:02:41,073 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:02:41,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:02:41,078 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:02:41" (1/1) ... [2024-11-20 17:02:41,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dd8bf2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:02:41, skipping insertion in model container [2024-11-20 17:02:41,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:02:41" (1/1) ... [2024-11-20 17:02:41,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:02:41,609 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:41,654 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:41,660 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:41,667 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:41,678 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:41,716 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:41,717 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:41,719 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:41,720 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:41,724 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:41,730 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:41,731 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:41,733 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:41,745 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:41,747 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:41,751 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:41,752 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:41,755 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:41,755 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:41,759 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:41,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:02:41,781 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-20 17:02:41,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@53aebb97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:02:41, skipping insertion in model container [2024-11-20 17:02:41,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:02:41,784 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-20 17:02:41,786 INFO L158 Benchmark]: Toolchain (without parser) took 713.90ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 70.3MB in the beginning and 135.8MB in the end (delta: -65.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 17:02:41,787 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 142.6MB. Free memory is still 112.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 17:02:41,788 INFO L158 Benchmark]: CACSL2BoogieTranslator took 710.80ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 70.0MB in the beginning and 135.8MB in the end (delta: -65.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 17:02:41,789 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.21ms. Allocated memory is still 142.6MB. Free memory is still 112.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 710.80ms. Allocated memory was 142.6MB in the beginning and 186.6MB in the end (delta: 44.0MB). Free memory was 70.0MB in the beginning and 135.8MB in the end (delta: -65.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 750]: 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_OAT_nondet_test3-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 be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 17:02:43,869 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:02:43,957 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-20 17:02:43,964 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:02:43,964 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:02:43,996 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:02:43,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:02:43,999 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:02:44,000 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:02:44,001 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:02:44,001 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:02:44,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:02:44,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:02:44,004 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:02:44,005 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:02:44,005 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:02:44,005 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:02:44,006 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:02:44,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:02:44,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:02:44,007 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 17:02:44,007 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 17:02:44,010 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 17:02:44,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:02:44,011 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 17:02:44,011 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 17:02:44,012 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:02:44,012 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 17:02:44,012 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:02:44,012 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:02:44,012 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:02:44,013 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:02:44,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:02:44,014 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:02:44,014 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:02:44,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:02:44,014 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:02:44,015 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:02:44,015 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 17:02:44,015 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 17:02:44,015 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:02:44,016 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:02:44,016 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:02:44,016 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:02:44,016 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 -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2024-11-20 17:02:44,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:02:44,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:02:44,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:02:44,398 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:02:44,398 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:02:44,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i [2024-11-20 17:02:45,956 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:02:46,303 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:02:46,306 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i [2024-11-20 17:02:46,329 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/438c507c2/e228883509f1448494d3400f8e573c40/FLAG2e8e4c3f5 [2024-11-20 17:02:46,348 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/438c507c2/e228883509f1448494d3400f8e573c40 [2024-11-20 17:02:46,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:02:46,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:02:46,355 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:02:46,356 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:02:46,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:02:46,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:02:46" (1/1) ... [2024-11-20 17:02:46,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57cb8a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:02:46, skipping insertion in model container [2024-11-20 17:02:46,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:02:46" (1/1) ... [2024-11-20 17:02:46,423 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:02:46,878 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:46,914 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:46,919 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:46,929 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:46,940 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:46,974 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:46,974 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:46,978 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:46,979 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:46,982 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:46,984 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:46,986 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:46,987 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:46,992 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:46,996 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,003 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,004 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,010 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,011 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,019 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:02:47,047 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-20 17:02:47,064 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:02:47,085 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,105 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,107 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,110 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,114 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,141 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,142 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,143 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,144 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,146 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,147 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,151 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,158 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,161 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,166 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,168 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,170 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,171 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,173 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,176 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:02:47,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:02:47,184 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 17:02:47,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:02:47,327 INFO L204 MainTranslator]: Completed translation [2024-11-20 17:02:47,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:02:47 WrapperNode [2024-11-20 17:02:47,328 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:02:47,329 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 17:02:47,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 17:02:47,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 17:02:47,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:02:47" (1/1) ... [2024-11-20 17:02:47,384 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:02:47" (1/1) ... [2024-11-20 17:02:47,459 INFO L138 Inliner]: procedures = 180, calls = 325, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1217 [2024-11-20 17:02:47,461 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 17:02:47,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 17:02:47,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 17:02:47,464 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 17:02:47,475 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:02:47" (1/1) ... [2024-11-20 17:02:47,476 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:02:47" (1/1) ... [2024-11-20 17:02:47,494 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:02:47" (1/1) ... [2024-11-20 17:02:47,589 INFO L175 MemorySlicer]: Split 302 memory accesses to 3 slices as follows [2, 34, 266]. 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, 4, 58]. [2024-11-20 17:02:47,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:02:47" (1/1) ... [2024-11-20 17:02:47,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:02:47" (1/1) ... [2024-11-20 17:02:47,640 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:02:47" (1/1) ... [2024-11-20 17:02:47,649 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:02:47" (1/1) ... [2024-11-20 17:02:47,654 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:02:47" (1/1) ... [2024-11-20 17:02:47,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:02:47" (1/1) ... [2024-11-20 17:02:47,681 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 17:02:47,682 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 17:02:47,682 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 17:02:47,682 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 17:02:47,686 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:02:47" (1/1) ... [2024-11-20 17:02:47,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:02:47,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:02:47,728 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 17:02:47,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 17:02:47,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-20 17:02:47,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-20 17:02:47,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-20 17:02:47,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-20 17:02:47,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-20 17:02:47,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-20 17:02:47,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-20 17:02:47,815 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-20 17:02:47,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-20 17:02:47,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-20 17:02:47,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-20 17:02:47,815 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-20 17:02:47,815 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-20 17:02:47,816 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-20 17:02:47,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 17:02:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 17:02:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 17:02:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 17:02:47,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-20 17:02:47,818 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 17:02:47,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 17:02:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 17:02:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-20 17:02:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-20 17:02:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-20 17:02:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-20 17:02:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 17:02:47,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 17:02:47,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-20 17:02:47,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-20 17:02:47,820 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 17:02:47,820 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 17:02:48,054 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 17:02:48,056 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 17:02:48,060 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-20 17:02:48,126 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-20 17:02:48,153 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-20 17:02:52,542 INFO L? ?]: Removed 1301 outVars from TransFormulas that were not future-live. [2024-11-20 17:02:52,542 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 17:02:52,578 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 17:02:52,578 INFO L316 CfgBuilder]: Removed 72 assume(true) statements. [2024-11-20 17:02:52,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:02:52 BoogieIcfgContainer [2024-11-20 17:02:52,578 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 17:02:52,585 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 17:02:52,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 17:02:52,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 17:02:52,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:02:46" (1/3) ... [2024-11-20 17:02:52,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162df600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:02:52, skipping insertion in model container [2024-11-20 17:02:52,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:02:47" (2/3) ... [2024-11-20 17:02:52,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@162df600 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:02:52, skipping insertion in model container [2024-11-20 17:02:52,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:02:52" (3/3) ... [2024-11-20 17:02:52,592 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test3-2.i [2024-11-20 17:02:52,611 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 17:02:52,611 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 630 error locations. [2024-11-20 17:02:52,686 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 17:02:52,692 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;@6109fff5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 17:02:52,693 INFO L334 AbstractCegarLoop]: Starting to check reachability of 630 error locations. [2024-11-20 17:02:52,700 INFO L276 IsEmpty]: Start isEmpty. Operand has 1260 states, 625 states have (on average 2.2352) internal successors, (1397), 1253 states have internal predecessors, (1397), 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-11-20 17:02:52,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-20 17:02:52,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:02:52,707 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-20 17:02:52,707 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr628ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:02:52,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:02:52,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1758702, now seen corresponding path program 1 times [2024-11-20 17:02:52,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:02:52,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467078363] [2024-11-20 17:02:52,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:02:52,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:02:52,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:02:52,730 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:02:52,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 17:02:52,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:02:52,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 17:02:52,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:02:52,984 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_46| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_46|)) (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_46| (_ bv0 1)) |c_#valid|))) is different from true [2024-11-20 17:02:52,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:02:52,990 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:02:52,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:02:52,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467078363] [2024-11-20 17:02:52,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1467078363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:02:52,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:02:52,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:02:52,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880069536] [2024-11-20 17:02:52,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:02:53,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:02:53,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:02:53,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:02:53,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-20 17:02:53,035 INFO L87 Difference]: Start difference. First operand has 1260 states, 625 states have (on average 2.2352) internal successors, (1397), 1253 states have internal predecessors, (1397), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:02:55,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:02:55,610 INFO L93 Difference]: Finished difference Result 1832 states and 1956 transitions. [2024-11-20 17:02:55,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:02:55,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-20 17:02:55,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:02:55,643 INFO L225 Difference]: With dead ends: 1832 [2024-11-20 17:02:55,643 INFO L226 Difference]: Without dead ends: 1829 [2024-11-20 17:02:55,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-20 17:02:55,650 INFO L432 NwaCegarLoop]: 1040 mSDtfsCounter, 616 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 1718 SdHoareTripleChecker+Invalid, 2903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1957 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-20 17:02:55,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 1718 Invalid, 2903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 946 Invalid, 0 Unknown, 1957 Unchecked, 2.4s Time] [2024-11-20 17:02:55,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2024-11-20 17:02:55,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1248. [2024-11-20 17:02:55,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 619 states have (on average 2.109854604200323) internal successors, (1306), 1241 states have internal predecessors, (1306), 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-11-20 17:02:55,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1316 transitions. [2024-11-20 17:02:55,785 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1316 transitions. Word has length 4 [2024-11-20 17:02:55,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:02:55,788 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 1316 transitions. [2024-11-20 17:02:55,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:02:55,789 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1316 transitions. [2024-11-20 17:02:55,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-20 17:02:55,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:02:55,791 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-20 17:02:55,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-20 17:02:55,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:02:55,993 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:02:55,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:02:55,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1756837, now seen corresponding path program 1 times [2024-11-20 17:02:55,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:02:55,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687987930] [2024-11-20 17:02:55,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:02:55,995 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:02:55,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:02:55,998 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:02:56,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 17:02:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:02:56,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:02:56,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:02:56,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 17:02:56,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:02:56,171 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:02:56,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:02:56,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687987930] [2024-11-20 17:02:56,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687987930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:02:56,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:02:56,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 17:02:56,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137836928] [2024-11-20 17:02:56,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:02:56,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:02:56,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:02:56,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:02:56,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:02:56,177 INFO L87 Difference]: Start difference. First operand 1248 states and 1316 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:02:57,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:02:57,656 INFO L93 Difference]: Finished difference Result 1434 states and 1513 transitions. [2024-11-20 17:02:57,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:02:57,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-20 17:02:57,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:02:57,662 INFO L225 Difference]: With dead ends: 1434 [2024-11-20 17:02:57,662 INFO L226 Difference]: Without dead ends: 1434 [2024-11-20 17:02:57,662 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:02:57,663 INFO L432 NwaCegarLoop]: 754 mSDtfsCounter, 1157 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 919 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 17:02:57,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 919 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 17:02:57,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2024-11-20 17:02:57,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 1247. [2024-11-20 17:02:57,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 628 states have (on average 2.0812101910828025) internal successors, (1307), 1239 states have internal predecessors, (1307), 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-11-20 17:02:57,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1317 transitions. [2024-11-20 17:02:57,691 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1317 transitions. Word has length 4 [2024-11-20 17:02:57,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:02:57,691 INFO L471 AbstractCegarLoop]: Abstraction has 1247 states and 1317 transitions. [2024-11-20 17:02:57,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:02:57,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1317 transitions. [2024-11-20 17:02:57,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-20 17:02:57,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:02:57,692 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-20 17:02:57,696 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 (3)] Forceful destruction successful, exit code 0 [2024-11-20 17:02:57,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:02:57,894 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:02:57,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:02:57,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1756838, now seen corresponding path program 1 times [2024-11-20 17:02:57,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:02:57,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829095623] [2024-11-20 17:02:57,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:02:57,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:02:57,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:02:57,898 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:02:57,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-20 17:02:58,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:02:58,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:02:58,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:02:58,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 17:02:58,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:02:58,066 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:02:58,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:02:58,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829095623] [2024-11-20 17:02:58,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [829095623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:02:58,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:02:58,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 17:02:58,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16492028] [2024-11-20 17:02:58,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:02:58,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:02:58,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:02:58,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:02:58,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:02:58,069 INFO L87 Difference]: Start difference. First operand 1247 states and 1317 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:00,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:00,460 INFO L93 Difference]: Finished difference Result 1853 states and 1968 transitions. [2024-11-20 17:03:00,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:03:00,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-20 17:03:00,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:00,466 INFO L225 Difference]: With dead ends: 1853 [2024-11-20 17:03:00,467 INFO L226 Difference]: Without dead ends: 1853 [2024-11-20 17:03:00,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:03:00,468 INFO L432 NwaCegarLoop]: 1020 mSDtfsCounter, 645 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 896 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 647 SdHoareTripleChecker+Valid, 1712 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:00,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [647 Valid, 1712 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 896 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-20 17:03:00,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1853 states. [2024-11-20 17:03:00,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1853 to 1457. [2024-11-20 17:03:00,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 838 states have (on average 2.064439140811456) internal successors, (1730), 1448 states have internal predecessors, (1730), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 17:03:00,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 1742 transitions. [2024-11-20 17:03:00,529 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 1742 transitions. Word has length 4 [2024-11-20 17:03:00,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:00,529 INFO L471 AbstractCegarLoop]: Abstraction has 1457 states and 1742 transitions. [2024-11-20 17:03:00,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:00,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1742 transitions. [2024-11-20 17:03:00,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 17:03:00,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:00,530 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:03:00,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-20 17:03:00,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:00,733 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:00,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:00,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1021429073, now seen corresponding path program 1 times [2024-11-20 17:03:00,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:00,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833623829] [2024-11-20 17:03:00,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:03:00,735 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:00,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:00,738 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:00,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 17:03:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:03:00,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 17:03:00,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:00,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 17:03:00,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 17:03:00,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 17:03:00,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 17:03:00,973 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-20 17:03:00,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-20 17:03:01,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:01,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:03:01,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:01,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833623829] [2024-11-20 17:03:01,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833623829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:03:01,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:03:01,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:03:01,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911123824] [2024-11-20 17:03:01,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:03:01,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:03:01,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:01,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:03:01,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:03:01,005 INFO L87 Difference]: Start difference. First operand 1457 states and 1742 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:03,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:03,295 INFO L93 Difference]: Finished difference Result 1638 states and 1933 transitions. [2024-11-20 17:03:03,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:03:03,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2024-11-20 17:03:03,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:03,301 INFO L225 Difference]: With dead ends: 1638 [2024-11-20 17:03:03,301 INFO L226 Difference]: Without dead ends: 1638 [2024-11-20 17:03:03,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:03:03,302 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 1459 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:03,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 545 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-20 17:03:03,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2024-11-20 17:03:03,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1235. [2024-11-20 17:03:03,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 628 states have (on average 2.0589171974522293) internal successors, (1293), 1227 states have internal predecessors, (1293), 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-11-20 17:03:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1303 transitions. [2024-11-20 17:03:03,325 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1303 transitions. Word has length 8 [2024-11-20 17:03:03,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:03,326 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1303 transitions. [2024-11-20 17:03:03,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:03,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1303 transitions. [2024-11-20 17:03:03,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-20 17:03:03,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:03,327 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:03:03,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-20 17:03:03,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:03,527 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:03,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:03,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530194, now seen corresponding path program 1 times [2024-11-20 17:03:03,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:03,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [161672807] [2024-11-20 17:03:03,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:03:03,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:03,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:03,530 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:03,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-20 17:03:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:03:03,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:03:03,652 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:03,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 17:03:03,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:03,673 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:03:03,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:03,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [161672807] [2024-11-20 17:03:03,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [161672807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:03:03,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:03:03,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 17:03:03,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758495546] [2024-11-20 17:03:03,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:03:03,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:03:03,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:03,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:03:03,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:03:03,675 INFO L87 Difference]: Start difference. First operand 1235 states and 1303 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:05,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:05,228 INFO L93 Difference]: Finished difference Result 1572 states and 1671 transitions. [2024-11-20 17:03:05,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:03:05,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-20 17:03:05,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:05,233 INFO L225 Difference]: With dead ends: 1572 [2024-11-20 17:03:05,234 INFO L226 Difference]: Without dead ends: 1572 [2024-11-20 17:03:05,234 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:03:05,234 INFO L432 NwaCegarLoop]: 1164 mSDtfsCounter, 929 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 866 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 934 SdHoareTripleChecker+Valid, 1515 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:05,235 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [934 Valid, 1515 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 866 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-20 17:03:05,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2024-11-20 17:03:05,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1187. [2024-11-20 17:03:05,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 628 states have (on average 1.982484076433121) internal successors, (1245), 1179 states have internal predecessors, (1245), 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-11-20 17:03:05,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1255 transitions. [2024-11-20 17:03:05,259 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1255 transitions. Word has length 9 [2024-11-20 17:03:05,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:05,260 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1255 transitions. [2024-11-20 17:03:05,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:05,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1255 transitions. [2024-11-20 17:03:05,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-20 17:03:05,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:05,261 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:03:05,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-20 17:03:05,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:05,462 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:05,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:05,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530193, now seen corresponding path program 1 times [2024-11-20 17:03:05,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:05,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834738940] [2024-11-20 17:03:05,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:03:05,463 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:05,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:05,465 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:05,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 17:03:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:03:05,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:03:05,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:05,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 17:03:05,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:05,626 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:03:05,626 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:05,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834738940] [2024-11-20 17:03:05,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834738940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:03:05,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:03:05,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 17:03:05,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585272157] [2024-11-20 17:03:05,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:03:05,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:03:05,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:05,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:03:05,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:03:05,627 INFO L87 Difference]: Start difference. First operand 1187 states and 1255 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:07,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:07,690 INFO L93 Difference]: Finished difference Result 1659 states and 1761 transitions. [2024-11-20 17:03:07,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:03:07,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-20 17:03:07,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:07,695 INFO L225 Difference]: With dead ends: 1659 [2024-11-20 17:03:07,695 INFO L226 Difference]: Without dead ends: 1659 [2024-11-20 17:03:07,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:03:07,696 INFO L432 NwaCegarLoop]: 1356 mSDtfsCounter, 691 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:07,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1886 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-20 17:03:07,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2024-11-20 17:03:07,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1214. [2024-11-20 17:03:07,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 665 states have (on average 1.9684210526315788) internal successors, (1309), 1206 states have internal predecessors, (1309), 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-11-20 17:03:07,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1319 transitions. [2024-11-20 17:03:07,725 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1319 transitions. Word has length 9 [2024-11-20 17:03:07,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:07,726 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1319 transitions. [2024-11-20 17:03:07,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:07,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1319 transitions. [2024-11-20 17:03:07,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 17:03:07,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:07,727 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:03:07,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-20 17:03:07,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:07,933 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:07,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:07,933 INFO L85 PathProgramCache]: Analyzing trace with hash -152807585, now seen corresponding path program 1 times [2024-11-20 17:03:07,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:07,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400749629] [2024-11-20 17:03:07,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:03:07,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:07,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:07,938 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:07,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-20 17:03:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:03:08,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 17:03:08,069 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:08,172 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:03:08,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:08,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400749629] [2024-11-20 17:03:08,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [400749629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:03:08,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:03:08,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:03:08,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119448069] [2024-11-20 17:03:08,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:03:08,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:03:08,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:08,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:03:08,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:03:08,174 INFO L87 Difference]: Start difference. First operand 1214 states and 1319 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-11-20 17:03:08,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:08,824 INFO L93 Difference]: Finished difference Result 1815 states and 2005 transitions. [2024-11-20 17:03:08,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:03:08,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-11-20 17:03:08,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:08,830 INFO L225 Difference]: With dead ends: 1815 [2024-11-20 17:03:08,830 INFO L226 Difference]: Without dead ends: 1815 [2024-11-20 17:03:08,830 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-11-20 17:03:08,831 INFO L432 NwaCegarLoop]: 1373 mSDtfsCounter, 635 mSDsluCounter, 2378 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 636 SdHoareTripleChecker+Valid, 3751 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:08,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [636 Valid, 3751 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 17:03:08,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2024-11-20 17:03:08,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1465. [2024-11-20 17:03:08,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1465 states, 915 states have (on average 1.9387978142076503) internal successors, (1774), 1456 states have internal predecessors, (1774), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 17:03:08,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 1786 transitions. [2024-11-20 17:03:08,857 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 1786 transitions. Word has length 12 [2024-11-20 17:03:08,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:08,857 INFO L471 AbstractCegarLoop]: Abstraction has 1465 states and 1786 transitions. [2024-11-20 17:03:08,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 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-11-20 17:03:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1786 transitions. [2024-11-20 17:03:08,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 17:03:08,858 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:08,858 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:03:08,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-20 17:03:09,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:09,059 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:09,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:09,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1410939272, now seen corresponding path program 1 times [2024-11-20 17:03:09,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:09,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [590222097] [2024-11-20 17:03:09,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:03:09,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:09,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:09,061 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:09,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-20 17:03:09,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:03:09,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:03:09,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:09,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:09,203 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:03:09,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:09,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [590222097] [2024-11-20 17:03:09,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [590222097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:03:09,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:03:09,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:03:09,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641546530] [2024-11-20 17:03:09,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:03:09,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:03:09,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:09,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:03:09,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:03:09,206 INFO L87 Difference]: Start difference. First operand 1465 states and 1786 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:09,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:09,228 INFO L93 Difference]: Finished difference Result 1405 states and 1700 transitions. [2024-11-20 17:03:09,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:03:09,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-20 17:03:09,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:09,232 INFO L225 Difference]: With dead ends: 1405 [2024-11-20 17:03:09,232 INFO L226 Difference]: Without dead ends: 1405 [2024-11-20 17:03:09,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:03:09,233 INFO L432 NwaCegarLoop]: 1181 mSDtfsCounter, 71 mSDsluCounter, 1118 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2299 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:09,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2299 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:03:09,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2024-11-20 17:03:09,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1405. [2024-11-20 17:03:09,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 879 states have (on average 1.9203640500568828) internal successors, (1688), 1396 states have internal predecessors, (1688), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 17:03:09,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1700 transitions. [2024-11-20 17:03:09,255 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1700 transitions. Word has length 14 [2024-11-20 17:03:09,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:09,256 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 1700 transitions. [2024-11-20 17:03:09,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:09,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1700 transitions. [2024-11-20 17:03:09,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-20 17:03:09,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:09,257 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:03:09,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-20 17:03:09,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:09,460 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr354REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:09,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:09,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1297050578, now seen corresponding path program 1 times [2024-11-20 17:03:09,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:09,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317365420] [2024-11-20 17:03:09,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:03:09,462 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:09,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:09,465 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:09,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-20 17:03:09,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:03:09,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:03:09,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:09,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:09,622 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:03:09,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:09,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317365420] [2024-11-20 17:03:09,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [317365420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:03:09,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:03:09,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:03:09,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913891168] [2024-11-20 17:03:09,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:03:09,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:03:09,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:09,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:03:09,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:03:09,624 INFO L87 Difference]: Start difference. First operand 1405 states and 1700 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:09,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:09,704 INFO L93 Difference]: Finished difference Result 1375 states and 1642 transitions. [2024-11-20 17:03:09,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:03:09,704 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-20 17:03:09,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:09,708 INFO L225 Difference]: With dead ends: 1375 [2024-11-20 17:03:09,708 INFO L226 Difference]: Without dead ends: 1375 [2024-11-20 17:03:09,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:03:09,709 INFO L432 NwaCegarLoop]: 1136 mSDtfsCounter, 48 mSDsluCounter, 2246 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3382 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:09,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3382 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 17:03:09,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2024-11-20 17:03:09,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1375. [2024-11-20 17:03:09,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1375 states, 863 states have (on average 1.888760139049826) internal successors, (1630), 1366 states have internal predecessors, (1630), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 17:03:09,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1375 states to 1375 states and 1642 transitions. [2024-11-20 17:03:09,737 INFO L78 Accepts]: Start accepts. Automaton has 1375 states and 1642 transitions. Word has length 16 [2024-11-20 17:03:09,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:09,737 INFO L471 AbstractCegarLoop]: Abstraction has 1375 states and 1642 transitions. [2024-11-20 17:03:09,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:09,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1375 states and 1642 transitions. [2024-11-20 17:03:09,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 17:03:09,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:09,738 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:03:09,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-20 17:03:09,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:09,942 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr628ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:09,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:09,942 INFO L85 PathProgramCache]: Analyzing trace with hash -653157182, now seen corresponding path program 1 times [2024-11-20 17:03:09,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:09,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [977203485] [2024-11-20 17:03:09,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:03:09,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:09,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:09,946 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:09,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-20 17:03:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:03:10,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 17:03:10,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:10,229 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_47| (_ BitVec 32))) (and (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_47| (_ bv0 1))) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_47|)))) is different from true [2024-11-20 17:03:10,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-11-20 17:03:10,230 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:03:10,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:10,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [977203485] [2024-11-20 17:03:10,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [977203485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:03:10,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:03:10,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:03:10,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278268272] [2024-11-20 17:03:10,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:03:10,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:03:10,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:10,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:03:10,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-20 17:03:10,232 INFO L87 Difference]: Start difference. First operand 1375 states and 1642 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) 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-11-20 17:03:11,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:11,512 INFO L93 Difference]: Finished difference Result 1675 states and 2017 transitions. [2024-11-20 17:03:11,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:03:11,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) 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-11-20 17:03:11,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:11,517 INFO L225 Difference]: With dead ends: 1675 [2024-11-20 17:03:11,517 INFO L226 Difference]: Without dead ends: 1667 [2024-11-20 17:03:11,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-20 17:03:11,518 INFO L432 NwaCegarLoop]: 1055 mSDtfsCounter, 246 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 1683 SdHoareTripleChecker+Invalid, 2059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1420 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:11,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 1683 Invalid, 2059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 639 Invalid, 0 Unknown, 1420 Unchecked, 1.2s Time] [2024-11-20 17:03:11,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2024-11-20 17:03:11,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1433. [2024-11-20 17:03:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 920 states have (on average 1.8478260869565217) internal successors, (1700), 1423 states have internal predecessors, (1700), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-20 17:03:11,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1714 transitions. [2024-11-20 17:03:11,541 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 1714 transitions. Word has length 17 [2024-11-20 17:03:11,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:11,541 INFO L471 AbstractCegarLoop]: Abstraction has 1433 states and 1714 transitions. [2024-11-20 17:03:11,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) 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-11-20 17:03:11,541 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1714 transitions. [2024-11-20 17:03:11,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 17:03:11,542 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:11,542 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:03:11,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-20 17:03:11,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:11,743 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:11,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:11,743 INFO L85 PathProgramCache]: Analyzing trace with hash -179577126, now seen corresponding path program 1 times [2024-11-20 17:03:11,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:11,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471311190] [2024-11-20 17:03:11,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:03:11,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:11,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:11,753 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:11,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-20 17:03:11,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:03:11,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 17:03:11,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:11,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:11,938 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:03:11,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:11,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471311190] [2024-11-20 17:03:11,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [471311190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:03:11,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:03:11,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:03:11,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998419359] [2024-11-20 17:03:11,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:03:11,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:03:11,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:11,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:03:11,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:03:11,941 INFO L87 Difference]: Start difference. First operand 1433 states and 1714 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:11,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:11,976 INFO L93 Difference]: Finished difference Result 1373 states and 1628 transitions. [2024-11-20 17:03:11,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:03:11,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 19 [2024-11-20 17:03:11,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:11,981 INFO L225 Difference]: With dead ends: 1373 [2024-11-20 17:03:11,981 INFO L226 Difference]: Without dead ends: 1373 [2024-11-20 17:03:11,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:03:11,982 INFO L432 NwaCegarLoop]: 1103 mSDtfsCounter, 71 mSDsluCounter, 1040 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2143 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:11,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2143 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:03:11,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2024-11-20 17:03:11,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1373. [2024-11-20 17:03:11,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 884 states have (on average 1.8257918552036199) internal successors, (1614), 1363 states have internal predecessors, (1614), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-20 17:03:12,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1628 transitions. [2024-11-20 17:03:12,001 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1628 transitions. Word has length 19 [2024-11-20 17:03:12,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:12,001 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 1628 transitions. [2024-11-20 17:03:12,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:12,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1628 transitions. [2024-11-20 17:03:12,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-20 17:03:12,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:12,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:03:12,010 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 (12)] Forceful destruction successful, exit code 0 [2024-11-20 17:03:12,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:12,209 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:12,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:12,209 INFO L85 PathProgramCache]: Analyzing trace with hash -774929132, now seen corresponding path program 1 times [2024-11-20 17:03:12,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:12,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057403398] [2024-11-20 17:03:12,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:03:12,210 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:12,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:12,211 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:12,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-20 17:03:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:03:12,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:03:12,371 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:12,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:12,391 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:03:12,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:12,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057403398] [2024-11-20 17:03:12,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1057403398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:03:12,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:03:12,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:03:12,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224683437] [2024-11-20 17:03:12,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:03:12,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:03:12,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:12,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:03:12,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:03:12,392 INFO L87 Difference]: Start difference. First operand 1373 states and 1628 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:12,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:12,444 INFO L93 Difference]: Finished difference Result 1343 states and 1570 transitions. [2024-11-20 17:03:12,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:03:12,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-20 17:03:12,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:12,448 INFO L225 Difference]: With dead ends: 1343 [2024-11-20 17:03:12,448 INFO L226 Difference]: Without dead ends: 1343 [2024-11-20 17:03:12,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:03:12,449 INFO L432 NwaCegarLoop]: 1058 mSDtfsCounter, 48 mSDsluCounter, 2090 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3148 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:12,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3148 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:03:12,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2024-11-20 17:03:12,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1343. [2024-11-20 17:03:12,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 868 states have (on average 1.792626728110599) internal successors, (1556), 1333 states have internal predecessors, (1556), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-20 17:03:12,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1570 transitions. [2024-11-20 17:03:12,466 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1570 transitions. Word has length 21 [2024-11-20 17:03:12,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:12,466 INFO L471 AbstractCegarLoop]: Abstraction has 1343 states and 1570 transitions. [2024-11-20 17:03:12,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:12,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1570 transitions. [2024-11-20 17:03:12,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-20 17:03:12,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:12,468 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:03:12,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-20 17:03:12,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:12,669 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr368REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:12,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:12,669 INFO L85 PathProgramCache]: Analyzing trace with hash 727437120, now seen corresponding path program 1 times [2024-11-20 17:03:12,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:12,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [219224075] [2024-11-20 17:03:12,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:03:12,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:12,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:12,671 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:12,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-20 17:03:12,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:03:12,808 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:03:12,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:12,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 17:03:12,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:12,890 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:03:12,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:12,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [219224075] [2024-11-20 17:03:12,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [219224075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:03:12,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:03:12,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:03:12,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684982803] [2024-11-20 17:03:12,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:03:12,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:03:12,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:12,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:03:12,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:03:12,892 INFO L87 Difference]: Start difference. First operand 1343 states and 1570 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:14,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:14,586 INFO L93 Difference]: Finished difference Result 1538 states and 1766 transitions. [2024-11-20 17:03:14,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:03:14,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 30 [2024-11-20 17:03:14,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:14,591 INFO L225 Difference]: With dead ends: 1538 [2024-11-20 17:03:14,591 INFO L226 Difference]: Without dead ends: 1538 [2024-11-20 17:03:14,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:03:14,592 INFO L432 NwaCegarLoop]: 650 mSDtfsCounter, 963 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 1096 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:14,592 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 1372 Invalid, 1105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1096 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-20 17:03:14,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2024-11-20 17:03:14,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 1339. [2024-11-20 17:03:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 868 states have (on average 1.7788018433179724) internal successors, (1544), 1329 states have internal predecessors, (1544), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-20 17:03:14,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 1558 transitions. [2024-11-20 17:03:14,607 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 1558 transitions. Word has length 30 [2024-11-20 17:03:14,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:14,608 INFO L471 AbstractCegarLoop]: Abstraction has 1339 states and 1558 transitions. [2024-11-20 17:03:14,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:14,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1558 transitions. [2024-11-20 17:03:14,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-20 17:03:14,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:14,609 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] [2024-11-20 17:03:14,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-20 17:03:14,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:14,813 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr369REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:14,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:14,813 INFO L85 PathProgramCache]: Analyzing trace with hash 727437121, now seen corresponding path program 1 times [2024-11-20 17:03:14,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:14,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682364678] [2024-11-20 17:03:14,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:03:14,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:14,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:14,818 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:14,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-20 17:03:14,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:03:14,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 17:03:14,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:14,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 17:03:15,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:15,148 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:03:15,148 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:15,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682364678] [2024-11-20 17:03:15,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682364678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:03:15,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:03:15,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:03:15,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039733427] [2024-11-20 17:03:15,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:03:15,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:03:15,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:15,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:03:15,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:03:15,150 INFO L87 Difference]: Start difference. First operand 1339 states and 1558 transitions. Second operand has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:17,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:17,518 INFO L93 Difference]: Finished difference Result 2020 states and 2374 transitions. [2024-11-20 17:03:17,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:03:17,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 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 30 [2024-11-20 17:03:17,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:17,525 INFO L225 Difference]: With dead ends: 2020 [2024-11-20 17:03:17,525 INFO L226 Difference]: Without dead ends: 2020 [2024-11-20 17:03:17,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:03:17,526 INFO L432 NwaCegarLoop]: 832 mSDtfsCounter, 573 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1951 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:17,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1951 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-20 17:03:17,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2020 states. [2024-11-20 17:03:17,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2020 to 1653. [2024-11-20 17:03:17,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1180 states have (on average 1.790677966101695) internal successors, (2113), 1641 states have internal predecessors, (2113), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-20 17:03:17,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2131 transitions. [2024-11-20 17:03:17,551 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2131 transitions. Word has length 30 [2024-11-20 17:03:17,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:17,551 INFO L471 AbstractCegarLoop]: Abstraction has 1653 states and 2131 transitions. [2024-11-20 17:03:17,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.0) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:17,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2131 transitions. [2024-11-20 17:03:17,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-20 17:03:17,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:17,553 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] [2024-11-20 17:03:17,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-20 17:03:17,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:17,757 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:17,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:17,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1929064798, now seen corresponding path program 1 times [2024-11-20 17:03:17,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:17,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003879085] [2024-11-20 17:03:17,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:03:17,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:17,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:17,759 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:17,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-20 17:03:17,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:03:17,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:03:17,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:17,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 17:03:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:18,013 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:03:18,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:18,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003879085] [2024-11-20 17:03:18,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003879085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:03:18,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:03:18,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:03:18,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292211519] [2024-11-20 17:03:18,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:03:18,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:03:18,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:18,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:03:18,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:03:18,014 INFO L87 Difference]: Start difference. First operand 1653 states and 2131 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:19,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:19,722 INFO L93 Difference]: Finished difference Result 2103 states and 2705 transitions. [2024-11-20 17:03:19,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:03:19,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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 35 [2024-11-20 17:03:19,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:19,730 INFO L225 Difference]: With dead ends: 2103 [2024-11-20 17:03:19,730 INFO L226 Difference]: Without dead ends: 2103 [2024-11-20 17:03:19,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:03:19,731 INFO L432 NwaCegarLoop]: 994 mSDtfsCounter, 780 mSDsluCounter, 1006 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 2000 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:19,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 2000 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 17:03:19,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2103 states. [2024-11-20 17:03:19,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2103 to 1649. [2024-11-20 17:03:19,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1649 states, 1180 states have (on average 1.7838983050847457) internal successors, (2105), 1637 states have internal predecessors, (2105), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-20 17:03:19,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1649 states to 1649 states and 2123 transitions. [2024-11-20 17:03:19,750 INFO L78 Accepts]: Start accepts. Automaton has 1649 states and 2123 transitions. Word has length 35 [2024-11-20 17:03:19,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:19,750 INFO L471 AbstractCegarLoop]: Abstraction has 1649 states and 2123 transitions. [2024-11-20 17:03:19,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:19,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1649 states and 2123 transitions. [2024-11-20 17:03:19,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-20 17:03:19,751 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:19,751 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] [2024-11-20 17:03:19,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-20 17:03:19,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:19,952 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:19,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:19,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1929064797, now seen corresponding path program 1 times [2024-11-20 17:03:19,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:19,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255597549] [2024-11-20 17:03:19,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:03:19,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:19,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:19,955 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:19,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-20 17:03:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:03:20,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 17:03:20,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:20,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 17:03:20,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:20,293 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:03:20,293 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:20,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255597549] [2024-11-20 17:03:20,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255597549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:03:20,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:03:20,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:03:20,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190704336] [2024-11-20 17:03:20,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:03:20,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:03:20,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:20,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:03:20,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:03:20,295 INFO L87 Difference]: Start difference. First operand 1649 states and 2123 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:22,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:22,740 INFO L93 Difference]: Finished difference Result 2163 states and 2729 transitions. [2024-11-20 17:03:22,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:03:22,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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 35 [2024-11-20 17:03:22,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:22,746 INFO L225 Difference]: With dead ends: 2163 [2024-11-20 17:03:22,746 INFO L226 Difference]: Without dead ends: 2163 [2024-11-20 17:03:22,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:03:22,747 INFO L432 NwaCegarLoop]: 1275 mSDtfsCounter, 538 mSDsluCounter, 1262 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 2537 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:22,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 2537 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-20 17:03:22,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2163 states. [2024-11-20 17:03:22,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2163 to 1645. [2024-11-20 17:03:22,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1645 states, 1180 states have (on average 1.7771186440677966) internal successors, (2097), 1633 states have internal predecessors, (2097), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-20 17:03:22,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1645 states to 1645 states and 2115 transitions. [2024-11-20 17:03:22,780 INFO L78 Accepts]: Start accepts. Automaton has 1645 states and 2115 transitions. Word has length 35 [2024-11-20 17:03:22,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:22,780 INFO L471 AbstractCegarLoop]: Abstraction has 1645 states and 2115 transitions. [2024-11-20 17:03:22,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:22,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1645 states and 2115 transitions. [2024-11-20 17:03:22,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-20 17:03:22,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:22,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:03:22,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-20 17:03:22,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:22,983 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr414REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:22,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:22,983 INFO L85 PathProgramCache]: Analyzing trace with hash 188750135, now seen corresponding path program 1 times [2024-11-20 17:03:22,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:22,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1730654326] [2024-11-20 17:03:22,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:03:22,984 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:22,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:22,985 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:22,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-20 17:03:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:03:23,153 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:03:23,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:23,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:23,190 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:03:23,190 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:23,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1730654326] [2024-11-20 17:03:23,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1730654326] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:03:23,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:03:23,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:03:23,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115895505] [2024-11-20 17:03:23,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:03:23,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:03:23,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:23,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:03:23,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:03:23,192 INFO L87 Difference]: Start difference. First operand 1645 states and 2115 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:23,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:23,237 INFO L93 Difference]: Finished difference Result 1615 states and 2065 transitions. [2024-11-20 17:03:23,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:03:23,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2024-11-20 17:03:23,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:23,243 INFO L225 Difference]: With dead ends: 1615 [2024-11-20 17:03:23,244 INFO L226 Difference]: Without dead ends: 1615 [2024-11-20 17:03:23,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:03:23,244 INFO L432 NwaCegarLoop]: 1048 mSDtfsCounter, 27 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3107 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:23,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3107 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:03:23,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1615 states. [2024-11-20 17:03:23,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1615 to 1615. [2024-11-20 17:03:23,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1150 states have (on average 1.78) internal successors, (2047), 1603 states have internal predecessors, (2047), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-20 17:03:23,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2065 transitions. [2024-11-20 17:03:23,265 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2065 transitions. Word has length 49 [2024-11-20 17:03:23,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:23,265 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 2065 transitions. [2024-11-20 17:03:23,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:23,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2065 transitions. [2024-11-20 17:03:23,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-20 17:03:23,266 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:23,266 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-11-20 17:03:23,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-20 17:03:23,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:23,467 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:23,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:23,468 INFO L85 PathProgramCache]: Analyzing trace with hash -848059422, now seen corresponding path program 1 times [2024-11-20 17:03:23,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:23,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051608454] [2024-11-20 17:03:23,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:03:23,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:23,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:23,473 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:23,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-20 17:03:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:03:23,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:03:23,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:23,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:23,762 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:03:23,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:23,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051608454] [2024-11-20 17:03:23,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051608454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:03:23,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:03:23,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:03:23,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431788634] [2024-11-20 17:03:23,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:03:23,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:03:23,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:23,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:03:23,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:03:23,764 INFO L87 Difference]: Start difference. First operand 1615 states and 2065 transitions. Second operand has 4 states, 4 states have (on average 13.5) 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-11-20 17:03:23,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:23,810 INFO L93 Difference]: Finished difference Result 1603 states and 2045 transitions. [2024-11-20 17:03:23,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:03:23,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) 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-11-20 17:03:23,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:23,815 INFO L225 Difference]: With dead ends: 1603 [2024-11-20 17:03:23,815 INFO L226 Difference]: Without dead ends: 1603 [2024-11-20 17:03:23,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:03:23,816 INFO L432 NwaCegarLoop]: 1044 mSDtfsCounter, 21 mSDsluCounter, 2057 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3101 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:23,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3101 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:03:23,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1603 states. [2024-11-20 17:03:23,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1603 to 1603. [2024-11-20 17:03:23,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1603 states, 1138 states have (on average 1.781195079086116) internal successors, (2027), 1591 states have internal predecessors, (2027), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-20 17:03:23,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1603 states to 1603 states and 2045 transitions. [2024-11-20 17:03:23,836 INFO L78 Accepts]: Start accepts. Automaton has 1603 states and 2045 transitions. Word has length 54 [2024-11-20 17:03:23,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:23,836 INFO L471 AbstractCegarLoop]: Abstraction has 1603 states and 2045 transitions. [2024-11-20 17:03:23,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) 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-11-20 17:03:23,836 INFO L276 IsEmpty]: Start isEmpty. Operand 1603 states and 2045 transitions. [2024-11-20 17:03:23,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-20 17:03:23,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:23,837 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] [2024-11-20 17:03:23,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-20 17:03:24,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:24,042 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr414REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:24,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:24,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1405455467, now seen corresponding path program 1 times [2024-11-20 17:03:24,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:24,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025452995] [2024-11-20 17:03:24,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:03:24,043 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:24,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:24,044 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:24,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-20 17:03:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:03:24,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:03:24,208 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:24,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:24,254 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:03:24,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:24,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025452995] [2024-11-20 17:03:24,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1025452995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:03:24,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:03:24,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:03:24,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522611517] [2024-11-20 17:03:24,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:03:24,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:03:24,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:24,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:03:24,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:03:24,258 INFO L87 Difference]: Start difference. First operand 1603 states and 2045 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:24,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:24,338 INFO L93 Difference]: Finished difference Result 1597 states and 1708 transitions. [2024-11-20 17:03:24,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:03:24,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 57 [2024-11-20 17:03:24,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:24,342 INFO L225 Difference]: With dead ends: 1597 [2024-11-20 17:03:24,342 INFO L226 Difference]: Without dead ends: 1597 [2024-11-20 17:03:24,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:03:24,343 INFO L432 NwaCegarLoop]: 1332 mSDtfsCounter, 313 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 2324 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:24,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 2324 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 17:03:24,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2024-11-20 17:03:24,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1240. [2024-11-20 17:03:24,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 777 states have (on average 1.6975546975546976) internal successors, (1319), 1230 states have internal predecessors, (1319), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-20 17:03:24,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1333 transitions. [2024-11-20 17:03:24,366 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1333 transitions. Word has length 57 [2024-11-20 17:03:24,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:24,367 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1333 transitions. [2024-11-20 17:03:24,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:24,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1333 transitions. [2024-11-20 17:03:24,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-20 17:03:24,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:24,368 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] [2024-11-20 17:03:24,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-20 17:03:24,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:24,569 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:24,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:24,569 INFO L85 PathProgramCache]: Analyzing trace with hash -2120436905, now seen corresponding path program 1 times [2024-11-20 17:03:24,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:24,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1920889263] [2024-11-20 17:03:24,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:03:24,570 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:24,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:24,573 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:24,574 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-20 17:03:24,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:03:24,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 17:03:24,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:24,792 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 17:03:24,792 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 17:03:24,793 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 17:03:24,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-20 17:03:24,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 17:03:24,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-20 17:03:24,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:24,894 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:03:24,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:24,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1920889263] [2024-11-20 17:03:24,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1920889263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:03:24,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:03:24,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 17:03:24,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358468059] [2024-11-20 17:03:24,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:03:24,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 17:03:24,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:24,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 17:03:24,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:03:24,896 INFO L87 Difference]: Start difference. First operand 1240 states and 1333 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:25,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:25,180 INFO L93 Difference]: Finished difference Result 1908 states and 2037 transitions. [2024-11-20 17:03:25,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:03:25,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 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 60 [2024-11-20 17:03:25,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:25,183 INFO L225 Difference]: With dead ends: 1908 [2024-11-20 17:03:25,183 INFO L226 Difference]: Without dead ends: 1905 [2024-11-20 17:03:25,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 17:03:25,184 INFO L432 NwaCegarLoop]: 1253 mSDtfsCounter, 1577 mSDsluCounter, 3760 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1585 SdHoareTripleChecker+Valid, 5013 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:25,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1585 Valid, 5013 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 17:03:25,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2024-11-20 17:03:25,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1187. [2024-11-20 17:03:25,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1187 states, 725 states have (on average 1.7462068965517241) internal successors, (1266), 1178 states have internal predecessors, (1266), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 17:03:25,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1187 states to 1187 states and 1278 transitions. [2024-11-20 17:03:25,199 INFO L78 Accepts]: Start accepts. Automaton has 1187 states and 1278 transitions. Word has length 60 [2024-11-20 17:03:25,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:25,199 INFO L471 AbstractCegarLoop]: Abstraction has 1187 states and 1278 transitions. [2024-11-20 17:03:25,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:25,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1187 states and 1278 transitions. [2024-11-20 17:03:25,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-20 17:03:25,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:25,200 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] [2024-11-20 17:03:25,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-20 17:03:25,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:25,401 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:25,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:25,401 INFO L85 PathProgramCache]: Analyzing trace with hash 887665558, now seen corresponding path program 1 times [2024-11-20 17:03:25,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:25,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444555422] [2024-11-20 17:03:25,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:03:25,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:25,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:25,403 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:25,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-20 17:03:25,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:03:25,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 17:03:25,763 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:25,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 17:03:25,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 17:03:26,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 17:03:26,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-20 17:03:26,275 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-20 17:03:26,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-20 17:03:26,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:26,289 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:03:26,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:26,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444555422] [2024-11-20 17:03:26,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444555422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:03:26,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:03:26,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:03:26,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178111211] [2024-11-20 17:03:26,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:03:26,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:03:26,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:26,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:03:26,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:03:26,292 INFO L87 Difference]: Start difference. First operand 1187 states and 1278 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:28,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:28,331 INFO L93 Difference]: Finished difference Result 1517 states and 1632 transitions. [2024-11-20 17:03:28,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:03:28,332 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), 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 62 [2024-11-20 17:03:28,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:28,335 INFO L225 Difference]: With dead ends: 1517 [2024-11-20 17:03:28,335 INFO L226 Difference]: Without dead ends: 1517 [2024-11-20 17:03:28,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:03:28,336 INFO L432 NwaCegarLoop]: 514 mSDtfsCounter, 1035 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1040 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:28,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1040 Valid, 822 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-20 17:03:28,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-11-20 17:03:28,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1112. [2024-11-20 17:03:28,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1112 states, 688 states have (on average 1.677325581395349) internal successors, (1154), 1103 states have internal predecessors, (1154), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 17:03:28,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1166 transitions. [2024-11-20 17:03:28,349 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1166 transitions. Word has length 62 [2024-11-20 17:03:28,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:28,350 INFO L471 AbstractCegarLoop]: Abstraction has 1112 states and 1166 transitions. [2024-11-20 17:03:28,350 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:28,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1166 transitions. [2024-11-20 17:03:28,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 17:03:28,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:28,351 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:03:28,360 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 (22)] Ended with exit code 0 [2024-11-20 17:03:28,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:28,551 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:28,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:28,552 INFO L85 PathProgramCache]: Analyzing trace with hash 512421051, now seen corresponding path program 1 times [2024-11-20 17:03:28,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:28,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786811426] [2024-11-20 17:03:28,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:03:28,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:28,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:28,554 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:28,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-20 17:03:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:03:28,871 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 17:03:28,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:28,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 17:03:28,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 17:03:28,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-20 17:03:28,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:28,928 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:03:28,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:28,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786811426] [2024-11-20 17:03:28,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786811426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:03:28,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:03:28,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:03:28,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273454057] [2024-11-20 17:03:28,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:03:28,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:03:28,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:28,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:03:28,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:03:28,929 INFO L87 Difference]: Start difference. First operand 1112 states and 1166 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:30,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:30,772 INFO L93 Difference]: Finished difference Result 1111 states and 1165 transitions. [2024-11-20 17:03:30,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:03:30,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2024-11-20 17:03:30,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:30,774 INFO L225 Difference]: With dead ends: 1111 [2024-11-20 17:03:30,774 INFO L226 Difference]: Without dead ends: 1111 [2024-11-20 17:03:30,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 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-11-20 17:03:30,775 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 2 mSDsluCounter, 1594 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2611 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:30,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2611 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-20 17:03:30,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1111 states. [2024-11-20 17:03:30,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1111 to 1111. [2024-11-20 17:03:30,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1111 states, 688 states have (on average 1.6758720930232558) internal successors, (1153), 1102 states have internal predecessors, (1153), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 17:03:30,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1165 transitions. [2024-11-20 17:03:30,783 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1165 transitions. Word has length 67 [2024-11-20 17:03:30,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:30,783 INFO L471 AbstractCegarLoop]: Abstraction has 1111 states and 1165 transitions. [2024-11-20 17:03:30,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:30,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1165 transitions. [2024-11-20 17:03:30,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-20 17:03:30,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:30,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:03:30,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-11-20 17:03:30,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:30,984 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:30,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:30,985 INFO L85 PathProgramCache]: Analyzing trace with hash 512421052, now seen corresponding path program 1 times [2024-11-20 17:03:30,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:30,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1822657102] [2024-11-20 17:03:30,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:03:30,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:30,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:30,988 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:30,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-20 17:03:31,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:03:31,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 17:03:31,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:31,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-20 17:03:31,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-20 17:03:31,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 17:03:31,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-20 17:03:31,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:31,334 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:03:31,335 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:31,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1822657102] [2024-11-20 17:03:31,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1822657102] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:03:31,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:03:31,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:03:31,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755962367] [2024-11-20 17:03:31,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:03:31,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:03:31,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:31,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:03:31,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:03:31,336 INFO L87 Difference]: Start difference. First operand 1111 states and 1165 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:33,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:33,574 INFO L93 Difference]: Finished difference Result 1110 states and 1164 transitions. [2024-11-20 17:03:33,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:03:33,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2024-11-20 17:03:33,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:33,576 INFO L225 Difference]: With dead ends: 1110 [2024-11-20 17:03:33,577 INFO L226 Difference]: Without dead ends: 1110 [2024-11-20 17:03:33,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 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-11-20 17:03:33,577 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 1 mSDsluCounter, 1634 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:33,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2651 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-20 17:03:33,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2024-11-20 17:03:33,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1110. [2024-11-20 17:03:33,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 687 states have (on average 1.6768558951965065) internal successors, (1152), 1101 states have internal predecessors, (1152), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-20 17:03:33,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 1164 transitions. [2024-11-20 17:03:33,585 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 1164 transitions. Word has length 67 [2024-11-20 17:03:33,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:33,585 INFO L471 AbstractCegarLoop]: Abstraction has 1110 states and 1164 transitions. [2024-11-20 17:03:33,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:03:33,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 1164 transitions. [2024-11-20 17:03:33,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-20 17:03:33,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:33,586 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:03:33,594 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 (24)] Forceful destruction successful, exit code 0 [2024-11-20 17:03:33,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:33,786 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:33,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:33,787 INFO L85 PathProgramCache]: Analyzing trace with hash 325834146, now seen corresponding path program 1 times [2024-11-20 17:03:33,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:33,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669787776] [2024-11-20 17:03:33,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:03:33,787 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:33,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:33,789 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:33,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-20 17:03:34,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:03:34,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-20 17:03:34,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:34,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:34,069 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 17:03:34,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:34,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669787776] [2024-11-20 17:03:34,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669787776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:03:34,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:03:34,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:03:34,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927645610] [2024-11-20 17:03:34,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:03:34,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:03:34,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:34,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:03:34,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:03:34,072 INFO L87 Difference]: Start difference. First operand 1110 states and 1164 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 17:03:34,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:34,104 INFO L93 Difference]: Finished difference Result 1113 states and 1168 transitions. [2024-11-20 17:03:34,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:03:34,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 75 [2024-11-20 17:03:34,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:34,108 INFO L225 Difference]: With dead ends: 1113 [2024-11-20 17:03:34,109 INFO L226 Difference]: Without dead ends: 1113 [2024-11-20 17:03:34,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:03:34,109 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 0 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3046 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:34,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3046 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:03:34,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1113 states. [2024-11-20 17:03:34,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1113 to 1113. [2024-11-20 17:03:34,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1113 states, 689 states have (on average 1.676342525399129) internal successors, (1155), 1104 states have internal predecessors, (1155), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-20 17:03:34,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1113 states to 1113 states and 1168 transitions. [2024-11-20 17:03:34,133 INFO L78 Accepts]: Start accepts. Automaton has 1113 states and 1168 transitions. Word has length 75 [2024-11-20 17:03:34,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:34,137 INFO L471 AbstractCegarLoop]: Abstraction has 1113 states and 1168 transitions. [2024-11-20 17:03:34,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-20 17:03:34,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1113 states and 1168 transitions. [2024-11-20 17:03:34,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-20 17:03:34,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:34,142 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:03:34,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-11-20 17:03:34,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:34,343 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:34,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:34,343 INFO L85 PathProgramCache]: Analyzing trace with hash -2051961243, now seen corresponding path program 1 times [2024-11-20 17:03:34,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:34,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1769524836] [2024-11-20 17:03:34,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:03:34,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:34,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:34,345 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:34,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-20 17:03:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:03:34,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 17:03:34,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:34,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:34,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:03:34,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:34,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:34,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1769524836] [2024-11-20 17:03:34,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1769524836] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:03:34,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:03:34,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-20 17:03:34,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341849579] [2024-11-20 17:03:34,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:03:34,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 17:03:34,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:34,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 17:03:34,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-20 17:03:34,708 INFO L87 Difference]: Start difference. First operand 1113 states and 1168 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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-11-20 17:03:34,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:34,825 INFO L93 Difference]: Finished difference Result 1125 states and 1185 transitions. [2024-11-20 17:03:34,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 17:03:34,827 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 76 [2024-11-20 17:03:34,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:34,829 INFO L225 Difference]: With dead ends: 1125 [2024-11-20 17:03:34,829 INFO L226 Difference]: Without dead ends: 1125 [2024-11-20 17:03:34,830 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-20 17:03:34,830 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 5 mSDsluCounter, 5065 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6082 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:34,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6082 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 17:03:34,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2024-11-20 17:03:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1123. [2024-11-20 17:03:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 698 states have (on average 1.67621776504298) internal successors, (1170), 1113 states have internal predecessors, (1170), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-20 17:03:34,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1183 transitions. [2024-11-20 17:03:34,843 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1183 transitions. Word has length 76 [2024-11-20 17:03:34,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:34,843 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1183 transitions. [2024-11-20 17:03:34,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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-11-20 17:03:34,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1183 transitions. [2024-11-20 17:03:34,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-20 17:03:34,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:34,844 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:03:34,852 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 (26)] Forceful destruction successful, exit code 0 [2024-11-20 17:03:35,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:35,045 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:35,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:35,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1400204898, now seen corresponding path program 2 times [2024-11-20 17:03:35,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:35,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [479908409] [2024-11-20 17:03:35,046 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 17:03:35,046 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:35,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:35,047 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:35,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-20 17:03:35,529 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 17:03:35,529 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:03:35,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 17:03:35,542 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:35,581 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:35,581 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:03:35,701 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:35,701 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:35,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [479908409] [2024-11-20 17:03:35,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [479908409] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:03:35,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:03:35,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-20 17:03:35,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040769128] [2024-11-20 17:03:35,702 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:03:35,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 17:03:35,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:35,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 17:03:35,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-20 17:03:35,704 INFO L87 Difference]: Start difference. First operand 1123 states and 1183 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 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-11-20 17:03:36,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:36,075 INFO L93 Difference]: Finished difference Result 1138 states and 1205 transitions. [2024-11-20 17:03:36,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 17:03:36,076 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 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 79 [2024-11-20 17:03:36,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:36,080 INFO L225 Difference]: With dead ends: 1138 [2024-11-20 17:03:36,081 INFO L226 Difference]: Without dead ends: 1134 [2024-11-20 17:03:36,081 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 144 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-11-20 17:03:36,082 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 13 mSDsluCounter, 5074 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 6091 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:36,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 6091 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 17:03:36,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1134 states. [2024-11-20 17:03:36,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1134 to 1132. [2024-11-20 17:03:36,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 707 states have (on average 1.6718528995756718) internal successors, (1182), 1122 states have internal predecessors, (1182), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-20 17:03:36,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1195 transitions. [2024-11-20 17:03:36,102 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1195 transitions. Word has length 79 [2024-11-20 17:03:36,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:36,102 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1195 transitions. [2024-11-20 17:03:36,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 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-11-20 17:03:36,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1195 transitions. [2024-11-20 17:03:36,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-20 17:03:36,103 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:36,103 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:03:36,112 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 (27)] Forceful destruction successful, exit code 0 [2024-11-20 17:03:36,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:36,304 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:36,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:36,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1968004994, now seen corresponding path program 3 times [2024-11-20 17:03:36,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:36,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370500783] [2024-11-20 17:03:36,305 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 17:03:36,305 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:36,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:36,306 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:36,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-20 17:03:36,993 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-20 17:03:36,994 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:03:37,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 17:03:37,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:37,123 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:37,123 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:03:37,645 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:37,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:37,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370500783] [2024-11-20 17:03:37,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370500783] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:03:37,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:03:37,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-20 17:03:37,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197269855] [2024-11-20 17:03:37,646 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:03:37,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-20 17:03:37,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:37,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-20 17:03:37,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-20 17:03:37,649 INFO L87 Difference]: Start difference. First operand 1132 states and 1195 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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-11-20 17:03:39,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:39,043 INFO L93 Difference]: Finished difference Result 1156 states and 1234 transitions. [2024-11-20 17:03:39,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-20 17:03:39,043 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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 85 [2024-11-20 17:03:39,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:39,046 INFO L225 Difference]: With dead ends: 1156 [2024-11-20 17:03:39,046 INFO L226 Difference]: Without dead ends: 1150 [2024-11-20 17:03:39,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-20 17:03:39,047 INFO L432 NwaCegarLoop]: 1018 mSDtfsCounter, 18 mSDsluCounter, 11166 mSDsCounter, 0 mSdLazyCounter, 577 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 12184 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:39,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 12184 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 577 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 17:03:39,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-11-20 17:03:39,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1150. [2024-11-20 17:03:39,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 725 states have (on average 1.6620689655172414) internal successors, (1205), 1140 states have internal predecessors, (1205), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-20 17:03:39,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1218 transitions. [2024-11-20 17:03:39,060 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1218 transitions. Word has length 85 [2024-11-20 17:03:39,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:39,060 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1218 transitions. [2024-11-20 17:03:39,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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-11-20 17:03:39,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1218 transitions. [2024-11-20 17:03:39,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-20 17:03:39,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:39,062 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:03:39,074 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 (28)] Ended with exit code 0 [2024-11-20 17:03:39,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:39,263 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:39,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:39,263 INFO L85 PathProgramCache]: Analyzing trace with hash 894122434, now seen corresponding path program 4 times [2024-11-20 17:03:39,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:39,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1926599489] [2024-11-20 17:03:39,264 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-20 17:03:39,264 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:39,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:39,265 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:39,266 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 (29)] Waiting until timeout for monitored process [2024-11-20 17:03:39,740 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-20 17:03:39,741 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:03:39,755 INFO L255 TraceCheckSpWp]: Trace formula consists of 574 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 17:03:39,758 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:40,077 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:40,078 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:03:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:03:41,203 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:41,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1926599489] [2024-11-20 17:03:41,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1926599489] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 17:03:41,203 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:03:41,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-20 17:03:41,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28247917] [2024-11-20 17:03:41,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:03:41,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-20 17:03:41,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 17:03:41,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-20 17:03:41,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-20 17:03:41,206 INFO L87 Difference]: Start difference. First operand 1150 states and 1218 transitions. Second operand has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 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-11-20 17:03:45,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:03:45,587 INFO L93 Difference]: Finished difference Result 1190 states and 1290 transitions. [2024-11-20 17:03:45,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-20 17:03:45,589 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 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 97 [2024-11-20 17:03:45,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:03:45,591 INFO L225 Difference]: With dead ends: 1190 [2024-11-20 17:03:45,592 INFO L226 Difference]: Without dead ends: 1186 [2024-11-20 17:03:45,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-20 17:03:45,595 INFO L432 NwaCegarLoop]: 1017 mSDtfsCounter, 32 mSDsluCounter, 23325 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 24342 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-20 17:03:45,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 24342 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-20 17:03:45,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2024-11-20 17:03:45,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 1184. [2024-11-20 17:03:45,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 759 states have (on average 1.6482213438735178) internal successors, (1251), 1174 states have internal predecessors, (1251), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-20 17:03:45,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1264 transitions. [2024-11-20 17:03:45,609 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1264 transitions. Word has length 97 [2024-11-20 17:03:45,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:03:45,611 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1264 transitions. [2024-11-20 17:03:45,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 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-11-20 17:03:45,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1264 transitions. [2024-11-20 17:03:45,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-20 17:03:45,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:03:45,613 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:03:45,627 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 (29)] Ended with exit code 0 [2024-11-20 17:03:45,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:45,813 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-20 17:03:45,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:03:45,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1141193246, now seen corresponding path program 5 times [2024-11-20 17:03:45,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 17:03:45,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1904907077] [2024-11-20 17:03:45,815 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-20 17:03:45,815 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 17:03:45,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 17:03:45,816 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 17:03:45,817 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 (30)] Waiting until timeout for monitored process [2024-11-20 17:03:46,962 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-20 17:03:46,962 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 17:03:46,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 816 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-20 17:03:46,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:03:47,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-20 17:03:47,124 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-20 17:03:47,124 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-11-20 17:03:47,157 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-11-20 17:03:47,270 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-11-20 17:03:48,240 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:03:48,241 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-11-20 17:03:48,297 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-11-20 17:03:48,334 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-20 17:03:48,334 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:03:48,724 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 17:03:48,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1904907077] [2024-11-20 17:03:48,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1904907077] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:03:48,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [582341830] [2024-11-20 17:03:48,724 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-20 17:03:48,724 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 17:03:48,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 17:03:48,725 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 17:03:48,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process