./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_test8-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 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_test8-1.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 5eef0a1d7c251abc753eabb723fe850489bfd10ab147ced1a31e6821eaf88c98 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 18:40:36,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 18:40:36,425 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 18:40:36,436 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 18:40:36,436 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 18:40:36,472 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 18:40:36,473 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 18:40:36,473 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 18:40:36,474 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 18:40:36,475 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 18:40:36,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 18:40:36,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 18:40:36,476 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 18:40:36,478 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 18:40:36,479 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 18:40:36,479 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 18:40:36,480 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 18:40:36,483 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 18:40:36,484 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 18:40:36,484 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 18:40:36,484 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 18:40:36,485 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 18:40:36,485 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 18:40:36,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 18:40:36,485 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 18:40:36,486 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 18:40:36,486 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 18:40:36,486 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 18:40:36,486 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 18:40:36,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 18:40:36,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 18:40:36,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 18:40:36,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 18:40:36,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:40:36,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 18:40:36,490 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 18:40:36,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 18:40:36,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 18:40:36,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 18:40:36,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 18:40:36,492 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 18:40:36,492 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 18:40:36,492 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 -> 5eef0a1d7c251abc753eabb723fe850489bfd10ab147ced1a31e6821eaf88c98 [2024-10-24 18:40:36,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 18:40:36,805 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 18:40:36,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 18:40:36,809 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 18:40:36,810 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 18:40:36,812 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i [2024-10-24 18:40:38,354 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 18:40:38,677 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 18:40:38,681 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i [2024-10-24 18:40:38,707 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff113d3a0/fea854c8245c4c759da0ba90df558e3b/FLAG1edbb2678 [2024-10-24 18:40:38,725 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff113d3a0/fea854c8245c4c759da0ba90df558e3b [2024-10-24 18:40:38,728 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 18:40:38,730 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 18:40:38,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 18:40:38,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 18:40:38,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 18:40:38,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:40:38" (1/1) ... [2024-10-24 18:40:38,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b9a52ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:38, skipping insertion in model container [2024-10-24 18:40:38,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:40:38" (1/1) ... [2024-10-24 18:40:38,806 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:40:39,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:40:39,388 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-10-24 18:40:39,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@65b49652 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:39, skipping insertion in model container [2024-10-24 18:40:39,389 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 18:40:39,412 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-10-24 18:40:39,414 INFO L158 Benchmark]: Toolchain (without parser) took 682.80ms. Allocated memory is still 201.3MB. Free memory was 127.4MB in the beginning and 170.5MB in the end (delta: -43.1MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2024-10-24 18:40:39,414 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 155.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 18:40:39,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 678.34ms. Allocated memory is still 201.3MB. Free memory was 127.2MB in the beginning and 170.5MB in the end (delta: -43.3MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. [2024-10-24 18:40:39,416 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.20ms. Allocated memory is still 201.3MB. Free memory is still 155.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 678.34ms. Allocated memory is still 201.3MB. Free memory was 127.2MB in the beginning and 170.5MB in the end (delta: -43.3MB). Peak memory consumption was 27.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 766]: 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_test8-1.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 5eef0a1d7c251abc753eabb723fe850489bfd10ab147ced1a31e6821eaf88c98 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 18:40:41,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 18:40:41,749 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-24 18:40:41,756 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 18:40:41,757 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 18:40:41,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 18:40:41,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 18:40:41,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 18:40:41,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 18:40:41,792 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 18:40:41,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 18:40:41,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 18:40:41,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 18:40:41,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 18:40:41,794 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 18:40:41,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 18:40:41,795 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 18:40:41,795 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 18:40:41,798 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 18:40:41,798 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 18:40:41,801 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 18:40:41,801 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 18:40:41,801 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 18:40:41,801 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 18:40:41,802 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 18:40:41,802 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 18:40:41,802 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 18:40:41,802 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 18:40:41,803 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 18:40:41,803 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 18:40:41,803 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 18:40:41,804 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 18:40:41,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 18:40:41,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 18:40:41,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 18:40:41,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:40:41,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 18:40:41,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 18:40:41,807 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 18:40:41,808 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 18:40:41,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 18:40:41,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 18:40:41,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 18:40:41,809 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 18:40:41,809 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 18:40:41,809 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 -> 5eef0a1d7c251abc753eabb723fe850489bfd10ab147ced1a31e6821eaf88c98 [2024-10-24 18:40:42,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 18:40:42,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 18:40:42,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 18:40:42,186 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 18:40:42,186 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 18:40:42,189 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i [2024-10-24 18:40:43,884 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 18:40:44,197 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 18:40:44,198 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test8-1.i [2024-10-24 18:40:44,217 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67833507b/9b4f70c1f6a24ad89ac20ee34f4b7143/FLAG63f704fba [2024-10-24 18:40:44,233 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67833507b/9b4f70c1f6a24ad89ac20ee34f4b7143 [2024-10-24 18:40:44,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 18:40:44,236 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 18:40:44,238 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 18:40:44,238 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 18:40:44,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 18:40:44,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:40:44" (1/1) ... [2024-10-24 18:40:44,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d7b661 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:44, skipping insertion in model container [2024-10-24 18:40:44,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 06:40:44" (1/1) ... [2024-10-24 18:40:44,328 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:40:44,985 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:40:45,012 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-10-24 18:40:45,049 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 18:40:45,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:40:45,154 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 18:40:45,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 18:40:45,297 INFO L204 MainTranslator]: Completed translation [2024-10-24 18:40:45,298 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:45 WrapperNode [2024-10-24 18:40:45,298 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 18:40:45,299 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 18:40:45,299 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 18:40:45,300 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 18:40:45,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:45" (1/1) ... [2024-10-24 18:40:45,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:45" (1/1) ... [2024-10-24 18:40:45,416 INFO L138 Inliner]: procedures = 180, calls = 291, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 1037 [2024-10-24 18:40:45,417 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 18:40:45,418 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 18:40:45,418 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 18:40:45,418 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 18:40:45,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:45" (1/1) ... [2024-10-24 18:40:45,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:45" (1/1) ... [2024-10-24 18:40:45,459 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:45" (1/1) ... [2024-10-24 18:40:45,547 INFO L175 MemorySlicer]: Split 256 memory accesses to 3 slices as follows [2, 34, 220]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 4, 50]. [2024-10-24 18:40:45,551 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:45" (1/1) ... [2024-10-24 18:40:45,552 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:45" (1/1) ... [2024-10-24 18:40:45,600 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:45" (1/1) ... [2024-10-24 18:40:45,631 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:45" (1/1) ... [2024-10-24 18:40:45,640 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:45" (1/1) ... [2024-10-24 18:40:45,652 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:45" (1/1) ... [2024-10-24 18:40:45,667 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 18:40:45,668 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 18:40:45,668 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 18:40:45,668 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 18:40:45,669 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:45" (1/1) ... [2024-10-24 18:40:45,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 18:40:45,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 18:40:45,703 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 18:40:45,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 18:40:45,745 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-24 18:40:45,746 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-24 18:40:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-10-24 18:40:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-10-24 18:40:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-10-24 18:40:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-24 18:40:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-24 18:40:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-24 18:40:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-24 18:40:45,746 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-24 18:40:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-24 18:40:45,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-24 18:40:45,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-24 18:40:45,747 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-24 18:40:45,747 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-24 18:40:45,747 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-24 18:40:45,747 INFO L130 BoogieDeclarations]: Found specification of procedure test_int [2024-10-24 18:40:45,747 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int [2024-10-24 18:40:45,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 18:40:45,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 18:40:45,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 18:40:45,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-24 18:40:45,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-24 18:40:45,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 18:40:45,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 18:40:45,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 18:40:45,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 18:40:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 18:40:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-24 18:40:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-24 18:40:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-24 18:40:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 18:40:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-24 18:40:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-24 18:40:45,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 18:40:45,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 18:40:45,996 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 18:40:46,000 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 18:40:46,027 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-24 18:40:46,070 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-24 18:40:46,095 WARN L779 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-10-24 18:40:50,314 INFO L? ?]: Removed 1099 outVars from TransFormulas that were not future-live. [2024-10-24 18:40:50,315 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 18:40:50,505 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 18:40:50,505 INFO L314 CfgBuilder]: Removed 62 assume(true) statements. [2024-10-24 18:40:50,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:40:50 BoogieIcfgContainer [2024-10-24 18:40:50,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 18:40:50,508 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 18:40:50,509 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 18:40:50,512 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 18:40:50,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 06:40:44" (1/3) ... [2024-10-24 18:40:50,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc5a47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:40:50, skipping insertion in model container [2024-10-24 18:40:50,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 06:40:45" (2/3) ... [2024-10-24 18:40:50,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc5a47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 06:40:50, skipping insertion in model container [2024-10-24 18:40:50,516 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 06:40:50" (3/3) ... [2024-10-24 18:40:50,517 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test8-1.i [2024-10-24 18:40:50,534 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 18:40:50,534 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 529 error locations. [2024-10-24 18:40:50,614 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 18:40:50,623 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;@11a5c060, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 18:40:50,623 INFO L334 AbstractCegarLoop]: Starting to check reachability of 529 error locations. [2024-10-24 18:40:50,630 INFO L276 IsEmpty]: Start isEmpty. Operand has 998 states, 445 states have (on average 2.4898876404494383) internal successors, (1108), 988 states have internal predecessors, (1108), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 18:40:50,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-24 18:40:50,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:40:50,636 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-24 18:40:50,636 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-24 18:40:50,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:40:50,643 INFO L85 PathProgramCache]: Analyzing trace with hash 60491, now seen corresponding path program 1 times [2024-10-24 18:40:50,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:40:50,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [559284088] [2024-10-24 18:40:50,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:40:50,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:40:50,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:40:50,655 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:40:50,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 18:40:50,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:40:50,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:40:50,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:40:50,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 18:40:50,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:40:50,898 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:40:50,899 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:40:50,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [559284088] [2024-10-24 18:40:50,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [559284088] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:40:50,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:40:50,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 18:40:50,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893572967] [2024-10-24 18:40:50,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:40:50,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:40:50,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:40:50,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:40:50,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:40:50,968 INFO L87 Difference]: Start difference. First operand has 998 states, 445 states have (on average 2.4898876404494383) internal successors, (1108), 988 states have internal predecessors, (1108), 22 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:40:52,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:40:52,432 INFO L93 Difference]: Finished difference Result 1001 states and 1088 transitions. [2024-10-24 18:40:52,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:40:52,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-24 18:40:52,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:40:52,457 INFO L225 Difference]: With dead ends: 1001 [2024-10-24 18:40:52,457 INFO L226 Difference]: Without dead ends: 1000 [2024-10-24 18:40:52,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:40:52,462 INFO L432 NwaCegarLoop]: 588 mSDtfsCounter, 871 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-24 18:40:52,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 710 Invalid, 580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-24 18:40:52,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2024-10-24 18:40:52,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 988. [2024-10-24 18:40:52,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 451 states have (on average 2.29490022172949) internal successors, (1035), 977 states have internal predecessors, (1035), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 18:40:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1079 transitions. [2024-10-24 18:40:52,577 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1079 transitions. Word has length 2 [2024-10-24 18:40:52,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:40:52,578 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1079 transitions. [2024-10-24 18:40:52,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:40:52,578 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1079 transitions. [2024-10-24 18:40:52,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2024-10-24 18:40:52,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:40:52,579 INFO L215 NwaCegarLoop]: trace histogram [1, 1] [2024-10-24 18:40:52,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 18:40:52,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:40:52,784 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-24 18:40:52,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:40:52,785 INFO L85 PathProgramCache]: Analyzing trace with hash 60492, now seen corresponding path program 1 times [2024-10-24 18:40:52,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:40:52,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958915272] [2024-10-24 18:40:52,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:40:52,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:40:52,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:40:52,788 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:40:52,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 (3)] Waiting until timeout for monitored process [2024-10-24 18:40:52,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:40:52,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:40:52,916 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:40:52,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 18:40:52,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:40:52,941 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:40:52,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:40:52,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958915272] [2024-10-24 18:40:52,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958915272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:40:52,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:40:52,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-24 18:40:52,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918640401] [2024-10-24 18:40:52,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:40:52,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:40:52,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:40:52,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:40:52,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:40:52,944 INFO L87 Difference]: Start difference. First operand 988 states and 1079 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:40:55,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:40:55,101 INFO L93 Difference]: Finished difference Result 1354 states and 1477 transitions. [2024-10-24 18:40:55,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:40:55,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2024-10-24 18:40:55,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:40:55,110 INFO L225 Difference]: With dead ends: 1354 [2024-10-24 18:40:55,110 INFO L226 Difference]: Without dead ends: 1354 [2024-10-24 18:40:55,110 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:40:55,114 INFO L432 NwaCegarLoop]: 805 mSDtfsCounter, 394 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1346 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 18:40:55,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1346 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 18:40:55,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2024-10-24 18:40:55,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1165. [2024-10-24 18:40:55,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 628 states have (on average 2.2754777070063694) internal successors, (1429), 1153 states have internal predecessors, (1429), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 18:40:55,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1475 transitions. [2024-10-24 18:40:55,151 INFO L78 Accepts]: Start accepts. Automaton has 1165 states and 1475 transitions. Word has length 2 [2024-10-24 18:40:55,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:40:55,151 INFO L471 AbstractCegarLoop]: Abstraction has 1165 states and 1475 transitions. [2024-10-24 18:40:55,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:40:55,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1165 states and 1475 transitions. [2024-10-24 18:40:55,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-24 18:40:55,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:40:55,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 18:40:55,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 18:40:55,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:40:55,353 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-24 18:40:55,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:40:55,353 INFO L85 PathProgramCache]: Analyzing trace with hash 33496533, now seen corresponding path program 1 times [2024-10-24 18:40:55,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:40:55,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025900145] [2024-10-24 18:40:55,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:40:55,354 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:40:55,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:40:55,358 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:40:55,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 18:40:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:40:55,491 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 18:40:55,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:40:55,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 18:40:55,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 18:40:55,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 18:40:55,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 18:40:55,590 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 18:40:55,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-24 18:40:55,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:40:55,617 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:40:55,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:40:55,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025900145] [2024-10-24 18:40:55,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1025900145] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:40:55,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:40:55,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:40:55,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472733911] [2024-10-24 18:40:55,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:40:55,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:40:55,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:40:55,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:40:55,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:40:55,621 INFO L87 Difference]: Start difference. First operand 1165 states and 1475 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:40:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:40:57,498 INFO L93 Difference]: Finished difference Result 1171 states and 1479 transitions. [2024-10-24 18:40:57,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:40:57,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-24 18:40:57,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:40:57,503 INFO L225 Difference]: With dead ends: 1171 [2024-10-24 18:40:57,503 INFO L226 Difference]: Without dead ends: 1171 [2024-10-24 18:40:57,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:40:57,504 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 1838 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 829 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1844 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 18:40:57,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1844 Valid, 419 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 829 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 18:40:57,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2024-10-24 18:40:57,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 976. [2024-10-24 18:40:57,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 451 states have (on average 2.2660753880266076) internal successors, (1022), 965 states have internal predecessors, (1022), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 18:40:57,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1066 transitions. [2024-10-24 18:40:57,526 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1066 transitions. Word has length 6 [2024-10-24 18:40:57,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:40:57,526 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1066 transitions. [2024-10-24 18:40:57,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:40:57,527 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1066 transitions. [2024-10-24 18:40:57,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 18:40:57,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:40:57,527 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:40:57,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 18:40:57,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:40:57,728 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-24 18:40:57,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:40:57,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1038392618, now seen corresponding path program 1 times [2024-10-24 18:40:57,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:40:57,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644761169] [2024-10-24 18:40:57,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:40:57,730 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:40:57,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:40:57,733 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:40:57,735 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 18:40:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:40:57,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:40:57,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:40:57,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 18:40:57,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:40:57,884 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:40:57,884 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:40:57,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644761169] [2024-10-24 18:40:57,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1644761169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:40:57,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:40:57,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:40:57,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761995903] [2024-10-24 18:40:57,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:40:57,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:40:57,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:40:57,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:40:57,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:40:57,888 INFO L87 Difference]: Start difference. First operand 976 states and 1066 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:40:59,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:40:59,381 INFO L93 Difference]: Finished difference Result 1276 states and 1395 transitions. [2024-10-24 18:40:59,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:40:59,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-24 18:40:59,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:40:59,387 INFO L225 Difference]: With dead ends: 1276 [2024-10-24 18:40:59,388 INFO L226 Difference]: Without dead ends: 1276 [2024-10-24 18:40:59,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:40:59,389 INFO L432 NwaCegarLoop]: 839 mSDtfsCounter, 842 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 18:40:59,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 1109 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 793 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 18:40:59,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2024-10-24 18:40:59,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 928. [2024-10-24 18:40:59,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 451 states have (on average 2.1574279379157426) internal successors, (973), 917 states have internal predecessors, (973), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (21), 7 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-24 18:40:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 1017 transitions. [2024-10-24 18:40:59,414 INFO L78 Accepts]: Start accepts. Automaton has 928 states and 1017 transitions. Word has length 7 [2024-10-24 18:40:59,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:40:59,414 INFO L471 AbstractCegarLoop]: Abstraction has 928 states and 1017 transitions. [2024-10-24 18:40:59,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:40:59,415 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1017 transitions. [2024-10-24 18:40:59,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 18:40:59,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:40:59,417 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:40:59,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-24 18:40:59,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:40:59,618 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-24 18:40:59,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:40:59,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1038392619, now seen corresponding path program 1 times [2024-10-24 18:40:59,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:40:59,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [602362557] [2024-10-24 18:40:59,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:40:59,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:40:59,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:40:59,621 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:40:59,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-24 18:40:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:40:59,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:40:59,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:40:59,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 18:40:59,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:40:59,768 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:40:59,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:40:59,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [602362557] [2024-10-24 18:40:59,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [602362557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:40:59,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:40:59,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:40:59,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059306055] [2024-10-24 18:40:59,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:40:59,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:40:59,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:40:59,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:40:59,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:40:59,771 INFO L87 Difference]: Start difference. First operand 928 states and 1017 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:41:01,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:41:01,951 INFO L93 Difference]: Finished difference Result 1365 states and 1489 transitions. [2024-10-24 18:41:01,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:41:01,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-24 18:41:01,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:41:01,956 INFO L225 Difference]: With dead ends: 1365 [2024-10-24 18:41:01,956 INFO L226 Difference]: Without dead ends: 1365 [2024-10-24 18:41:01,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:41:01,957 INFO L432 NwaCegarLoop]: 1011 mSDtfsCounter, 635 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-24 18:41:01,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 1423 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-24 18:41:01,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2024-10-24 18:41:01,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1136. [2024-10-24 18:41:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1136 states, 667 states have (on average 2.151424287856072) internal successors, (1435), 1123 states have internal predecessors, (1435), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 18:41:01,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1136 states to 1136 states and 1483 transitions. [2024-10-24 18:41:01,980 INFO L78 Accepts]: Start accepts. Automaton has 1136 states and 1483 transitions. Word has length 7 [2024-10-24 18:41:01,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:41:01,981 INFO L471 AbstractCegarLoop]: Abstraction has 1136 states and 1483 transitions. [2024-10-24 18:41:01,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:41:01,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1136 states and 1483 transitions. [2024-10-24 18:41:01,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-24 18:41:01,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:41:01,982 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:41:01,986 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-10-24 18:41:02,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:02,185 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr527ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-24 18:41:02,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:41:02,186 INFO L85 PathProgramCache]: Analyzing trace with hash -2031260814, now seen corresponding path program 1 times [2024-10-24 18:41:02,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:41:02,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516318993] [2024-10-24 18:41:02,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:41:02,186 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:02,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:41:02,188 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:41:02,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-24 18:41:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:41:02,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-24 18:41:02,343 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:41:02,351 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 18:41:02,352 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 18:41:02,353 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 18:41:02,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-10-24 18:41:02,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 18:41:02,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-10-24 18:41:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:41:02,423 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:41:02,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:41:02,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516318993] [2024-10-24 18:41:02,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [516318993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:41:02,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:41:02,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:41:02,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746557771] [2024-10-24 18:41:02,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:41:02,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:41:02,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:41:02,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:41:02,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:41:02,424 INFO L87 Difference]: Start difference. First operand 1136 states and 1483 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-10-24 18:41:03,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:41:03,554 INFO L93 Difference]: Finished difference Result 2218 states and 2885 transitions. [2024-10-24 18:41:03,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:41:03,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-10-24 18:41:03,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:41:03,563 INFO L225 Difference]: With dead ends: 2218 [2024-10-24 18:41:03,564 INFO L226 Difference]: Without dead ends: 2218 [2024-10-24 18:41:03,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:41:03,566 INFO L432 NwaCegarLoop]: 869 mSDtfsCounter, 898 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 903 SdHoareTripleChecker+Valid, 2599 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 18:41:03,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [903 Valid, 2599 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 18:41:03,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2024-10-24 18:41:03,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 1138. [2024-10-24 18:41:03,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 669 states have (on average 2.1479820627802693) internal successors, (1437), 1125 states have internal predecessors, (1437), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 18:41:03,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1485 transitions. [2024-10-24 18:41:03,597 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1485 transitions. Word has length 9 [2024-10-24 18:41:03,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:41:03,597 INFO L471 AbstractCegarLoop]: Abstraction has 1138 states and 1485 transitions. [2024-10-24 18:41:03,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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-10-24 18:41:03,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1485 transitions. [2024-10-24 18:41:03,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-24 18:41:03,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:41:03,598 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:41:03,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-10-24 18:41:03,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:03,799 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-24 18:41:03,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:41:03,799 INFO L85 PathProgramCache]: Analyzing trace with hash -2109262366, now seen corresponding path program 1 times [2024-10-24 18:41:03,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:41:03,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430192505] [2024-10-24 18:41:03,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:41:03,801 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:03,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:41:03,803 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:41:03,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-10-24 18:41:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:41:03,952 INFO L255 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 18:41:03,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:41:03,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:41:03,967 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:41:03,967 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:41:03,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430192505] [2024-10-24 18:41:03,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430192505] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:41:03,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:41:03,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:41:03,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123230554] [2024-10-24 18:41:03,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:41:03,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:41:03,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:41:03,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:41:03,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:41:03,969 INFO L87 Difference]: Start difference. First operand 1138 states and 1485 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:41:04,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:41:04,386 INFO L93 Difference]: Finished difference Result 1099 states and 1445 transitions. [2024-10-24 18:41:04,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:41:04,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-24 18:41:04,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:41:04,390 INFO L225 Difference]: With dead ends: 1099 [2024-10-24 18:41:04,390 INFO L226 Difference]: Without dead ends: 1099 [2024-10-24 18:41:04,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:41:04,391 INFO L432 NwaCegarLoop]: 842 mSDtfsCounter, 61 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 18:41:04,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1642 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 18:41:04,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2024-10-24 18:41:04,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1099. [2024-10-24 18:41:04,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1099 states, 654 states have (on average 2.136085626911315) internal successors, (1397), 1086 states have internal predecessors, (1397), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 18:41:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1099 states to 1099 states and 1445 transitions. [2024-10-24 18:41:04,409 INFO L78 Accepts]: Start accepts. Automaton has 1099 states and 1445 transitions. Word has length 15 [2024-10-24 18:41:04,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:41:04,409 INFO L471 AbstractCegarLoop]: Abstraction has 1099 states and 1445 transitions. [2024-10-24 18:41:04,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:41:04,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1099 states and 1445 transitions. [2024-10-24 18:41:04,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-24 18:41:04,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:41:04,410 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:41:04,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-10-24 18:41:04,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:04,615 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-24 18:41:04,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:41:04,615 INFO L85 PathProgramCache]: Analyzing trace with hash 223429275, now seen corresponding path program 1 times [2024-10-24 18:41:04,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:41:04,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25025903] [2024-10-24 18:41:04,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:41:04,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:04,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:41:04,617 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:41:04,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-10-24 18:41:04,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:41:04,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:41:04,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:41:04,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:41:04,764 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:41:04,764 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:41:04,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25025903] [2024-10-24 18:41:04,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [25025903] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:41:04,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:41:04,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:41:04,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181110951] [2024-10-24 18:41:04,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:41:04,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:41:04,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:41:04,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:41:04,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:41:04,772 INFO L87 Difference]: Start difference. First operand 1099 states and 1445 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:41:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:41:05,299 INFO L93 Difference]: Finished difference Result 1084 states and 1423 transitions. [2024-10-24 18:41:05,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 18:41:05,300 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-24 18:41:05,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:41:05,302 INFO L225 Difference]: With dead ends: 1084 [2024-10-24 18:41:05,302 INFO L226 Difference]: Without dead ends: 1084 [2024-10-24 18:41:05,303 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:41:05,303 INFO L432 NwaCegarLoop]: 811 mSDtfsCounter, 45 mSDsluCounter, 1604 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2415 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 18:41:05,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2415 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 18:41:05,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2024-10-24 18:41:05,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1084. [2024-10-24 18:41:05,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 653 states have (on average 2.105666156202144) internal successors, (1375), 1071 states have internal predecessors, (1375), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 18:41:05,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1423 transitions. [2024-10-24 18:41:05,321 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1423 transitions. Word has length 17 [2024-10-24 18:41:05,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:41:05,321 INFO L471 AbstractCegarLoop]: Abstraction has 1084 states and 1423 transitions. [2024-10-24 18:41:05,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:41:05,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1423 transitions. [2024-10-24 18:41:05,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-24 18:41:05,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:41:05,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:41:05,328 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 (9)] Forceful destruction successful, exit code 0 [2024-10-24 18:41:05,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:05,523 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-24 18:41:05,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:41:05,523 INFO L85 PathProgramCache]: Analyzing trace with hash 553507241, now seen corresponding path program 1 times [2024-10-24 18:41:05,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:41:05,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032953218] [2024-10-24 18:41:05,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:41:05,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:05,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:41:05,525 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:41:05,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-10-24 18:41:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:41:05,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:41:05,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:41:05,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 18:41:05,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:41:05,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:41:05,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:41:05,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032953218] [2024-10-24 18:41:05,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032953218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:41:05,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:41:05,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:41:05,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421980805] [2024-10-24 18:41:05,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:41:05,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:41:05,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:41:05,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:41:05,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:41:05,764 INFO L87 Difference]: Start difference. First operand 1084 states and 1423 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:41:07,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:41:07,111 INFO L93 Difference]: Finished difference Result 1097 states and 1439 transitions. [2024-10-24 18:41:07,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:41:07,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-24 18:41:07,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:41:07,114 INFO L225 Difference]: With dead ends: 1097 [2024-10-24 18:41:07,114 INFO L226 Difference]: Without dead ends: 1097 [2024-10-24 18:41:07,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:41:07,115 INFO L432 NwaCegarLoop]: 471 mSDtfsCounter, 784 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 1003 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 789 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 1011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 18:41:07,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [789 Valid, 969 Invalid, 1011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1003 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 18:41:07,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2024-10-24 18:41:07,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 1080. [2024-10-24 18:41:07,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 653 states have (on average 2.099540581929556) internal successors, (1371), 1067 states have internal predecessors, (1371), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 18:41:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1419 transitions. [2024-10-24 18:41:07,132 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1419 transitions. Word has length 31 [2024-10-24 18:41:07,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:41:07,132 INFO L471 AbstractCegarLoop]: Abstraction has 1080 states and 1419 transitions. [2024-10-24 18:41:07,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:41:07,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1419 transitions. [2024-10-24 18:41:07,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-24 18:41:07,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:41:07,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:41:07,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-10-24 18:41:07,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:07,334 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-24 18:41:07,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:41:07,335 INFO L85 PathProgramCache]: Analyzing trace with hash 553507242, now seen corresponding path program 1 times [2024-10-24 18:41:07,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:41:07,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1943525245] [2024-10-24 18:41:07,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:41:07,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:07,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:41:07,338 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:41:07,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-10-24 18:41:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:41:07,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 18:41:07,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:41:07,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 18:41:07,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:41:07,686 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:41:07,686 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:41:07,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1943525245] [2024-10-24 18:41:07,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1943525245] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:41:07,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:41:07,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:41:07,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902617841] [2024-10-24 18:41:07,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:41:07,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:41:07,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:41:07,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:41:07,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:41:07,687 INFO L87 Difference]: Start difference. First operand 1080 states and 1419 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:41:09,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:41:09,567 INFO L93 Difference]: Finished difference Result 1309 states and 1425 transitions. [2024-10-24 18:41:09,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:41:09,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-24 18:41:09,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:41:09,571 INFO L225 Difference]: With dead ends: 1309 [2024-10-24 18:41:09,571 INFO L226 Difference]: Without dead ends: 1309 [2024-10-24 18:41:09,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:41:09,572 INFO L432 NwaCegarLoop]: 615 mSDtfsCounter, 573 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 575 SdHoareTripleChecker+Valid, 1455 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-24 18:41:09,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [575 Valid, 1455 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-24 18:41:09,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2024-10-24 18:41:09,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1076. [2024-10-24 18:41:09,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1076 states, 653 states have (on average 2.0934150076569678) internal successors, (1367), 1063 states have internal predecessors, (1367), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 18:41:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 1415 transitions. [2024-10-24 18:41:09,589 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 1415 transitions. Word has length 31 [2024-10-24 18:41:09,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:41:09,589 INFO L471 AbstractCegarLoop]: Abstraction has 1076 states and 1415 transitions. [2024-10-24 18:41:09,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:41:09,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 1415 transitions. [2024-10-24 18:41:09,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-24 18:41:09,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:41:09,592 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] [2024-10-24 18:41:09,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-10-24 18:41:09,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:09,797 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-24 18:41:09,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:41:09,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1433991645, now seen corresponding path program 1 times [2024-10-24 18:41:09,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:41:09,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [872486438] [2024-10-24 18:41:09,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:41:09,798 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:09,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:41:09,801 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:41:09,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-10-24 18:41:09,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:41:09,996 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:41:09,998 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:41:10,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:41:10,034 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:41:10,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:41:10,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [872486438] [2024-10-24 18:41:10,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [872486438] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:41:10,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:41:10,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:41:10,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535954900] [2024-10-24 18:41:10,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:41:10,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:41:10,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:41:10,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:41:10,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:41:10,036 INFO L87 Difference]: Start difference. First operand 1076 states and 1415 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:41:10,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:41:10,575 INFO L93 Difference]: Finished difference Result 1070 states and 1405 transitions. [2024-10-24 18:41:10,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 18:41:10,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 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 47 [2024-10-24 18:41:10,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:41:10,580 INFO L225 Difference]: With dead ends: 1070 [2024-10-24 18:41:10,580 INFO L226 Difference]: Without dead ends: 1070 [2024-10-24 18:41:10,580 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:41:10,581 INFO L432 NwaCegarLoop]: 805 mSDtfsCounter, 15 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 2398 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 18:41:10,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 2398 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 18:41:10,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2024-10-24 18:41:10,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1070. [2024-10-24 18:41:10,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 647 states have (on average 2.097372488408037) internal successors, (1357), 1057 states have internal predecessors, (1357), 25 states have call successors, (25), 4 states have call predecessors, (25), 3 states have return successors, (23), 9 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 18:41:10,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1405 transitions. [2024-10-24 18:41:10,595 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1405 transitions. Word has length 47 [2024-10-24 18:41:10,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:41:10,596 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1405 transitions. [2024-10-24 18:41:10,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:41:10,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1405 transitions. [2024-10-24 18:41:10,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-10-24 18:41:10,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:41:10,596 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] [2024-10-24 18:41:10,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-10-24 18:41:10,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:10,797 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-24 18:41:10,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:41:10,798 INFO L85 PathProgramCache]: Analyzing trace with hash -621555131, now seen corresponding path program 1 times [2024-10-24 18:41:10,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:41:10,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504488364] [2024-10-24 18:41:10,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:41:10,798 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:10,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:41:10,801 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:41:10,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-10-24 18:41:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:41:11,028 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:41:11,030 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:41:11,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:41:11,229 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:41:11,229 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:41:11,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504488364] [2024-10-24 18:41:11,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504488364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:41:11,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:41:11,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 18:41:11,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769905763] [2024-10-24 18:41:11,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:41:11,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 18:41:11,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:41:11,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 18:41:11,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:41:11,230 INFO L87 Difference]: Start difference. First operand 1070 states and 1405 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:41:11,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:41:11,962 INFO L93 Difference]: Finished difference Result 1525 states and 2073 transitions. [2024-10-24 18:41:11,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 18:41:11,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 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 51 [2024-10-24 18:41:11,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:41:11,966 INFO L225 Difference]: With dead ends: 1525 [2024-10-24 18:41:11,966 INFO L226 Difference]: Without dead ends: 1525 [2024-10-24 18:41:11,967 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 18:41:11,967 INFO L432 NwaCegarLoop]: 984 mSDtfsCounter, 287 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 317 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1729 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-24 18:41:11,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1729 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 317 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-24 18:41:11,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2024-10-24 18:41:11,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1378. [2024-10-24 18:41:11,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 953 states have (on average 2.079748163693599) internal successors, (1982), 1363 states have internal predecessors, (1982), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 11 states have call predecessors, (25), 25 states have call successors, (25) [2024-10-24 18:41:11,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 2034 transitions. [2024-10-24 18:41:11,991 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 2034 transitions. Word has length 51 [2024-10-24 18:41:11,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:41:11,991 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 2034 transitions. [2024-10-24 18:41:11,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 2 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:41:11,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 2034 transitions. [2024-10-24 18:41:11,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-24 18:41:11,993 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:41:11,993 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:41:12,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-10-24 18:41:12,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:12,194 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-24 18:41:12,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:41:12,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1252239301, now seen corresponding path program 1 times [2024-10-24 18:41:12,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:41:12,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [646967675] [2024-10-24 18:41:12,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:41:12,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:12,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:41:12,199 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:41:12,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-10-24 18:41:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:41:12,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 18:41:12,474 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:41:12,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 18:41:12,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 18:41:12,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 18:41:12,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-24 18:41:12,929 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-24 18:41:12,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-10-24 18:41:12,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-10-24 18:41:12,939 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:41:12,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:41:12,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [646967675] [2024-10-24 18:41:12,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [646967675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:41:12,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:41:12,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 18:41:12,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349242874] [2024-10-24 18:41:12,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:41:12,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:41:12,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:41:12,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:41:12,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:41:12,941 INFO L87 Difference]: Start difference. First operand 1378 states and 2034 transitions. Second operand has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:41:14,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:41:14,100 INFO L93 Difference]: Finished difference Result 1351 states and 2008 transitions. [2024-10-24 18:41:14,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:41:14,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2024-10-24 18:41:14,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:41:14,105 INFO L225 Difference]: With dead ends: 1351 [2024-10-24 18:41:14,105 INFO L226 Difference]: Without dead ends: 1351 [2024-10-24 18:41:14,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:41:14,106 INFO L432 NwaCegarLoop]: 288 mSDtfsCounter, 1448 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1453 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-24 18:41:14,106 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1453 Valid, 367 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-24 18:41:14,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2024-10-24 18:41:14,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 989. [2024-10-24 18:41:14,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 607 states have (on average 1.942339373970346) internal successors, (1179), 977 states have internal predecessors, (1179), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 18:41:14,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1225 transitions. [2024-10-24 18:41:14,124 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1225 transitions. Word has length 54 [2024-10-24 18:41:14,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:41:14,124 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1225 transitions. [2024-10-24 18:41:14,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.0) internal successors, (54), 4 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:41:14,124 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1225 transitions. [2024-10-24 18:41:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 18:41:14,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:41:14,127 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:41:14,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-10-24 18:41:14,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:14,328 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-24 18:41:14,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:41:14,328 INFO L85 PathProgramCache]: Analyzing trace with hash -780752689, now seen corresponding path program 1 times [2024-10-24 18:41:14,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:41:14,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736813897] [2024-10-24 18:41:14,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:41:14,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:14,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:41:14,331 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:41:14,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-10-24 18:41:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:41:14,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 18:41:14,599 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:41:14,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 18:41:14,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 18:41:14,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-24 18:41:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:41:14,655 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:41:14,655 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:41:14,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736813897] [2024-10-24 18:41:14,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [736813897] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:41:14,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:41:14,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:41:14,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123473602] [2024-10-24 18:41:14,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:41:14,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 18:41:14,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:41:14,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 18:41:14,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:41:14,656 INFO L87 Difference]: Start difference. First operand 989 states and 1225 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:41:16,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:41:16,186 INFO L93 Difference]: Finished difference Result 988 states and 1224 transitions. [2024-10-24 18:41:16,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 18:41:16,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-24 18:41:16,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:41:16,189 INFO L225 Difference]: With dead ends: 988 [2024-10-24 18:41:16,189 INFO L226 Difference]: Without dead ends: 988 [2024-10-24 18:41:16,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 18:41:16,190 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 2 mSDsluCounter, 1329 mSDsCounter, 0 mSdLazyCounter, 1366 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2106 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 18:41:16,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2106 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1366 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 18:41:16,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2024-10-24 18:41:16,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 988. [2024-10-24 18:41:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 988 states, 607 states have (on average 1.9406919275123558) internal successors, (1178), 976 states have internal predecessors, (1178), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 18:41:16,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1224 transitions. [2024-10-24 18:41:16,202 INFO L78 Accepts]: Start accepts. Automaton has 988 states and 1224 transitions. Word has length 58 [2024-10-24 18:41:16,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:41:16,202 INFO L471 AbstractCegarLoop]: Abstraction has 988 states and 1224 transitions. [2024-10-24 18:41:16,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:41:16,203 INFO L276 IsEmpty]: Start isEmpty. Operand 988 states and 1224 transitions. [2024-10-24 18:41:16,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 18:41:16,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:41:16,204 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:41:16,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-10-24 18:41:16,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:16,404 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-24 18:41:16,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:41:16,405 INFO L85 PathProgramCache]: Analyzing trace with hash -780752688, now seen corresponding path program 1 times [2024-10-24 18:41:16,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:41:16,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67875] [2024-10-24 18:41:16,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:41:16,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:16,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:41:16,406 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:41:16,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-10-24 18:41:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:41:16,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 18:41:16,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:41:16,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-24 18:41:16,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 18:41:16,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-24 18:41:16,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-24 18:41:16,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:41:16,726 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:41:16,727 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:41:16,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67875] [2024-10-24 18:41:16,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67875] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:41:16,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:41:16,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:41:16,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029414042] [2024-10-24 18:41:16,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:41:16,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 18:41:16,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:41:16,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 18:41:16,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 18:41:16,728 INFO L87 Difference]: Start difference. First operand 988 states and 1224 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:41:18,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:41:18,771 INFO L93 Difference]: Finished difference Result 987 states and 1223 transitions. [2024-10-24 18:41:18,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 18:41:18,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2024-10-24 18:41:18,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:41:18,776 INFO L225 Difference]: With dead ends: 987 [2024-10-24 18:41:18,777 INFO L226 Difference]: Without dead ends: 987 [2024-10-24 18:41:18,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-24 18:41:18,777 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 1 mSDsluCounter, 1369 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2146 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-24 18:41:18,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2146 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-24 18:41:18,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2024-10-24 18:41:18,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 987. [2024-10-24 18:41:18,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 987 states, 606 states have (on average 1.9422442244224423) internal successors, (1177), 975 states have internal predecessors, (1177), 24 states have call successors, (24), 4 states have call predecessors, (24), 3 states have return successors, (22), 8 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-24 18:41:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 1223 transitions. [2024-10-24 18:41:18,792 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 1223 transitions. Word has length 58 [2024-10-24 18:41:18,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:41:18,792 INFO L471 AbstractCegarLoop]: Abstraction has 987 states and 1223 transitions. [2024-10-24 18:41:18,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 18:41:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1223 transitions. [2024-10-24 18:41:18,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-24 18:41:18,793 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:41:18,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:41:18,805 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2024-10-24 18:41:18,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:18,994 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-24 18:41:18,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:41:18,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1640083757, now seen corresponding path program 1 times [2024-10-24 18:41:18,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:41:18,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704941571] [2024-10-24 18:41:18,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:41:18,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-10-24 18:41:18,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:41:18,996 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:41:18,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-10-24 18:41:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:41:19,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 18:41:19,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:41:19,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:41:19,303 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 18:41:19,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:41:19,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704941571] [2024-10-24 18:41:19,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704941571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 18:41:19,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 18:41:19,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 18:41:19,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227381231] [2024-10-24 18:41:19,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 18:41:19,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 18:41:19,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:41:19,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 18:41:19,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:41:19,305 INFO L87 Difference]: Start difference. First operand 987 states and 1223 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:41:19,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:41:19,927 INFO L93 Difference]: Finished difference Result 989 states and 1226 transitions. [2024-10-24 18:41:19,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 18:41:19,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2024-10-24 18:41:19,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:41:19,934 INFO L225 Difference]: With dead ends: 989 [2024-10-24 18:41:19,935 INFO L226 Difference]: Without dead ends: 989 [2024-10-24 18:41:19,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 18:41:19,935 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 0 mSDsluCounter, 1551 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2328 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 18:41:19,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2328 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 18:41:19,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 989 states. [2024-10-24 18:41:19,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 989 to 989. [2024-10-24 18:41:19,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 607 states have (on average 1.942339373970346) internal successors, (1179), 977 states have internal predecessors, (1179), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-24 18:41:19,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1226 transitions. [2024-10-24 18:41:19,952 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1226 transitions. Word has length 64 [2024-10-24 18:41:19,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:41:19,952 INFO L471 AbstractCegarLoop]: Abstraction has 989 states and 1226 transitions. [2024-10-24 18:41:19,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 18:41:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1226 transitions. [2024-10-24 18:41:19,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-24 18:41:19,953 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:41:19,953 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:41:19,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-10-24 18:41:20,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:20,154 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-24 18:41:20,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:41:20,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1189888449, now seen corresponding path program 1 times [2024-10-24 18:41:20,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:41:20,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547486008] [2024-10-24 18:41:20,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 18:41:20,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:20,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:41:20,157 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:41:20,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-10-24 18:41:20,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 18:41:20,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-24 18:41:20,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:41:20,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:41:20,457 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 18:41:20,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:41:20,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:41:20,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547486008] [2024-10-24 18:41:20,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547486008] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 18:41:20,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 18:41:20,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-24 18:41:20,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827735622] [2024-10-24 18:41:20,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 18:41:20,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 18:41:20,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:41:20,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 18:41:20,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 18:41:20,533 INFO L87 Difference]: Start difference. First operand 989 states and 1226 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 18:41:21,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:41:21,375 INFO L93 Difference]: Finished difference Result 998 states and 1240 transitions. [2024-10-24 18:41:21,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 18:41:21,377 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2024-10-24 18:41:21,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:41:21,380 INFO L225 Difference]: With dead ends: 998 [2024-10-24 18:41:21,380 INFO L226 Difference]: Without dead ends: 998 [2024-10-24 18:41:21,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-10-24 18:41:21,380 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 4 mSDsluCounter, 2323 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3099 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 18:41:21,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3099 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-24 18:41:21,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2024-10-24 18:41:21,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 997. [2024-10-24 18:41:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 614 states have (on average 1.9413680781758957) internal successors, (1192), 984 states have internal predecessors, (1192), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-24 18:41:21,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1239 transitions. [2024-10-24 18:41:21,391 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1239 transitions. Word has length 65 [2024-10-24 18:41:21,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:41:21,392 INFO L471 AbstractCegarLoop]: Abstraction has 997 states and 1239 transitions. [2024-10-24 18:41:21,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 8 states have internal predecessors, (66), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 18:41:21,392 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1239 transitions. [2024-10-24 18:41:21,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-24 18:41:21,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:41:21,392 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:41:21,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-10-24 18:41:21,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:21,593 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-24 18:41:21,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:41:21,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1402640979, now seen corresponding path program 2 times [2024-10-24 18:41:21,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:41:21,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [743581112] [2024-10-24 18:41:21,594 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 18:41:21,595 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:21,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:41:21,598 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:41:21,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-10-24 18:41:22,005 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 18:41:22,005 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 18:41:22,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-24 18:41:22,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:41:22,061 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:41:22,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 18:41:22,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:41:22,228 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:41:22,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [743581112] [2024-10-24 18:41:22,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [743581112] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 18:41:22,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 18:41:22,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-10-24 18:41:22,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112921181] [2024-10-24 18:41:22,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 18:41:22,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 18:41:22,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:41:22,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 18:41:22,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-10-24 18:41:22,234 INFO L87 Difference]: Start difference. First operand 997 states and 1239 transitions. Second operand has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 18:41:23,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:41:23,576 INFO L93 Difference]: Finished difference Result 1009 states and 1258 transitions. [2024-10-24 18:41:23,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 18:41:23,578 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 68 [2024-10-24 18:41:23,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:41:23,581 INFO L225 Difference]: With dead ends: 1009 [2024-10-24 18:41:23,581 INFO L226 Difference]: Without dead ends: 1007 [2024-10-24 18:41:23,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-10-24 18:41:23,582 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 7 mSDsluCounter, 3875 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 4651 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 18:41:23,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 4651 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 18:41:23,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2024-10-24 18:41:23,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 1006. [2024-10-24 18:41:23,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 623 states have (on average 1.9325842696629214) internal successors, (1204), 993 states have internal predecessors, (1204), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-24 18:41:23,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1251 transitions. [2024-10-24 18:41:23,606 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1251 transitions. Word has length 68 [2024-10-24 18:41:23,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:41:23,606 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1251 transitions. [2024-10-24 18:41:23,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.0) internal successors, (72), 14 states have internal predecessors, (72), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 18:41:23,606 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1251 transitions. [2024-10-24 18:41:23,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-10-24 18:41:23,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:41:23,610 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:41:23,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2024-10-24 18:41:23,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:23,811 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-24 18:41:23,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:41:23,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1438006381, now seen corresponding path program 3 times [2024-10-24 18:41:23,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:41:23,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883149787] [2024-10-24 18:41:23,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 18:41:23,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:23,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:41:23,814 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:41:23,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-10-24 18:41:24,394 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-24 18:41:24,394 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 18:41:24,406 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 18:41:24,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:41:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:41:24,525 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 18:41:24,970 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:41:24,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:41:24,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883149787] [2024-10-24 18:41:24,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883149787] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 18:41:24,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 18:41:24,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-10-24 18:41:24,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457484771] [2024-10-24 18:41:24,971 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 18:41:24,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 18:41:24,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:41:24,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 18:41:24,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-10-24 18:41:24,972 INFO L87 Difference]: Start difference. First operand 1006 states and 1251 transitions. Second operand has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 18:41:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:41:28,829 INFO L93 Difference]: Finished difference Result 1027 states and 1287 transitions. [2024-10-24 18:41:28,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-10-24 18:41:28,829 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 74 [2024-10-24 18:41:28,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:41:28,833 INFO L225 Difference]: With dead ends: 1027 [2024-10-24 18:41:28,833 INFO L226 Difference]: Without dead ends: 1024 [2024-10-24 18:41:28,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-10-24 18:41:28,834 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 13 mSDsluCounter, 12393 mSDsCounter, 0 mSdLazyCounter, 2063 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 13169 SdHoareTripleChecker+Invalid, 2078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 2063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-24 18:41:28,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 13169 Invalid, 2078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 2063 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-24 18:41:28,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1024 states. [2024-10-24 18:41:28,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1024 to 1024. [2024-10-24 18:41:28,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 641 states have (on average 1.9141965678627144) internal successors, (1227), 1011 states have internal predecessors, (1227), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-24 18:41:28,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1274 transitions. [2024-10-24 18:41:28,848 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1274 transitions. Word has length 74 [2024-10-24 18:41:28,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:41:28,849 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1274 transitions. [2024-10-24 18:41:28,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.5) internal successors, (84), 26 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 18:41:28,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1274 transitions. [2024-10-24 18:41:28,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-10-24 18:41:28,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:41:28,850 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:41:28,861 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 (20)] Ended with exit code 0 [2024-10-24 18:41:29,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:29,051 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-24 18:41:29,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:41:29,051 INFO L85 PathProgramCache]: Analyzing trace with hash 2143307283, now seen corresponding path program 4 times [2024-10-24 18:41:29,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:41:29,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418614694] [2024-10-24 18:41:29,052 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-24 18:41:29,052 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:29,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:41:29,055 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:41:29,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-10-24 18:41:29,641 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-24 18:41:29,641 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 18:41:29,653 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 18:41:29,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:41:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:41:29,967 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 18:41:31,226 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 18:41:31,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:41:31,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418614694] [2024-10-24 18:41:31,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418614694] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 18:41:31,227 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 18:41:31,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-10-24 18:41:31,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022809117] [2024-10-24 18:41:31,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 18:41:31,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-10-24 18:41:31,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 18:41:31,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-10-24 18:41:31,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 18:41:31,230 INFO L87 Difference]: Start difference. First operand 1024 states and 1274 transitions. Second operand has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 18:41:39,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 18:41:39,159 INFO L93 Difference]: Finished difference Result 1061 states and 1343 transitions. [2024-10-24 18:41:39,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-10-24 18:41:39,161 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 86 [2024-10-24 18:41:39,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 18:41:39,167 INFO L225 Difference]: With dead ends: 1061 [2024-10-24 18:41:39,167 INFO L226 Difference]: Without dead ends: 1059 [2024-10-24 18:41:39,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-10-24 18:41:39,174 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 26 mSDsluCounter, 17825 mSDsCounter, 0 mSdLazyCounter, 4037 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 18601 SdHoareTripleChecker+Invalid, 4089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 4037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-24 18:41:39,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 18601 Invalid, 4089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 4037 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-24 18:41:39,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1059 states. [2024-10-24 18:41:39,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1059 to 1058. [2024-10-24 18:41:39,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 675 states have (on average 1.885925925925926) internal successors, (1273), 1045 states have internal predecessors, (1273), 24 states have call successors, (24), 5 states have call predecessors, (24), 5 states have return successors, (23), 8 states have call predecessors, (23), 22 states have call successors, (23) [2024-10-24 18:41:39,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1320 transitions. [2024-10-24 18:41:39,189 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1320 transitions. Word has length 86 [2024-10-24 18:41:39,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 18:41:39,190 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1320 transitions. [2024-10-24 18:41:39,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 2.25) internal successors, (108), 50 states have internal predecessors, (108), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-24 18:41:39,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1320 transitions. [2024-10-24 18:41:39,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-24 18:41:39,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 18:41:39,191 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 18:41:39,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-10-24 18:41:39,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:39,392 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 526 more)] === [2024-10-24 18:41:39,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 18:41:39,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1103449427, now seen corresponding path program 5 times [2024-10-24 18:41:39,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 18:41:39,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403147597] [2024-10-24 18:41:39,394 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-24 18:41:39,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 18:41:39,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 18:41:39,395 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 18:41:39,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-10-24 18:41:40,604 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-10-24 18:41:40,604 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 18:41:40,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 809 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-10-24 18:41:40,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 18:41:40,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-10-24 18:41:40,754 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-10-24 18:41:40,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-10-24 18:41:40,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-24 18:41:40,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-10-24 18:41:41,816 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-10-24 18:41:41,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-10-24 18:41:41,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-10-24 18:41:41,906 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-10-24 18:41:41,907 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 18:41:42,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 18:41:42,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403147597] [2024-10-24 18:41:42,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403147597] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 18:41:42,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [615066478] [2024-10-24 18:41:42,254 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-24 18:41:42,254 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 18:41:42,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 18:41:42,256 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 18:41:42,267 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process