./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test23_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test23_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 03499c01c9320e6c56c78c984f54a0b0b3f62caee089ccaa631f137e86019454 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:49:56,077 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:49:56,158 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:49:56,166 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:49:56,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:49:56,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:49:56,195 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:49:56,195 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:49:56,196 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:49:56,196 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:49:56,196 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:49:56,197 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:49:56,198 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:49:56,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:49:56,200 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:49:56,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:49:56,201 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:49:56,201 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:49:56,201 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:49:56,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:49:56,202 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:49:56,206 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:49:56,206 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:49:56,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:49:56,207 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:49:56,207 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:49:56,207 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:49:56,207 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:49:56,208 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:49:56,208 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:49:56,208 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:49:56,208 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:49:56,209 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:49:56,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:49:56,210 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:49:56,211 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:49:56,211 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:49:56,211 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:49:56,211 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:49:56,211 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:49:56,212 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:49:56,212 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:49:56,212 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 -> 03499c01c9320e6c56c78c984f54a0b0b3f62caee089ccaa631f137e86019454 [2024-11-19 06:49:56,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:49:56,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:49:56,580 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:49:56,582 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:49:56,582 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:49:56,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_1.i [2024-11-19 06:49:58,073 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:49:58,402 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:49:58,403 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_1.i [2024-11-19 06:49:58,427 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04b823c89/32b26ba34ee544be977fc4d45b8ede32/FLAG5d40c20e6 [2024-11-19 06:49:58,653 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04b823c89/32b26ba34ee544be977fc4d45b8ede32 [2024-11-19 06:49:58,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:49:58,656 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:49:58,658 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:49:58,658 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:49:58,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:49:58,663 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:49:58" (1/1) ... [2024-11-19 06:49:58,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a310b23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:58, skipping insertion in model container [2024-11-19 06:49:58,664 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:49:58" (1/1) ... [2024-11-19 06:49:58,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:49:59,150 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:49:59,255 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:49:59,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:49:59,282 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-19 06:49:59,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@216a3577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:49:59, skipping insertion in model container [2024-11-19 06:49:59,283 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:49:59,284 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 06:49:59,288 INFO L158 Benchmark]: Toolchain (without parser) took 630.95ms. Allocated memory was 138.4MB in the beginning and 203.4MB in the end (delta: 65.0MB). Free memory was 81.9MB in the beginning and 171.5MB in the end (delta: -89.6MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2024-11-19 06:49:59,290 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 138.4MB. Free memory is still 113.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:49:59,290 INFO L158 Benchmark]: CACSL2BoogieTranslator took 626.17ms. Allocated memory was 138.4MB in the beginning and 203.4MB in the end (delta: 65.0MB). Free memory was 81.6MB in the beginning and 171.5MB in the end (delta: -89.9MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2024-11-19 06:49:59,292 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.24ms. Allocated memory is still 138.4MB. Free memory is still 113.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 626.17ms. Allocated memory was 138.4MB in the beginning and 203.4MB in the end (delta: 65.0MB). Free memory was 81.6MB in the beginning and 171.5MB in the end (delta: -89.9MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 607]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test23_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 03499c01c9320e6c56c78c984f54a0b0b3f62caee089ccaa631f137e86019454 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:50:01,459 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:50:01,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 06:50:01,546 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:50:01,547 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:50:01,582 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:50:01,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:50:01,585 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:50:01,585 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:50:01,586 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:50:01,586 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:50:01,586 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:50:01,587 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:50:01,588 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:50:01,589 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:50:01,589 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:50:01,590 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:50:01,590 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:50:01,590 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:50:01,591 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:50:01,591 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:50:01,591 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:50:01,591 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:50:01,592 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:50:01,592 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:50:01,592 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:50:01,592 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:50:01,593 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:50:01,593 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:50:01,593 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:50:01,593 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:50:01,594 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:50:01,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:50:01,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:50:01,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:50:01,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:50:01,595 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:50:01,595 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:50:01,598 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:50:01,598 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:50:01,598 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:50:01,599 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:50:01,599 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:50:01,600 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:50:01,600 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 -> 03499c01c9320e6c56c78c984f54a0b0b3f62caee089ccaa631f137e86019454 [2024-11-19 06:50:01,919 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:50:01,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:50:01,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:50:01,948 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:50:01,948 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:50:01,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_1.i [2024-11-19 06:50:03,593 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:50:03,857 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:50:03,858 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_1.i [2024-11-19 06:50:03,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4330a1d4/1181b3ba427b4226aa706f188cc8a45a/FLAG0f9cd6f26 [2024-11-19 06:50:03,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4330a1d4/1181b3ba427b4226aa706f188cc8a45a [2024-11-19 06:50:03,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:50:03,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:50:03,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:50:03,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:50:03,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:50:03,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:50:03" (1/1) ... [2024-11-19 06:50:03,906 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75afb976 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:03, skipping insertion in model container [2024-11-19 06:50:03,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:50:03" (1/1) ... [2024-11-19 06:50:03,950 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:50:04,324 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:50:04,432 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:50:04,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:50:04,464 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 06:50:04,472 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:50:04,503 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:50:04,529 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:50:04,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:50:04,554 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:50:04,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:50:04,669 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:50:04,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:04 WrapperNode [2024-11-19 06:50:04,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:50:04,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:50:04,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:50:04,672 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:50:04,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:04" (1/1) ... [2024-11-19 06:50:04,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:04" (1/1) ... [2024-11-19 06:50:04,755 INFO L138 Inliner]: procedures = 175, calls = 119, calls flagged for inlining = 30, calls inlined = 15, statements flattened = 203 [2024-11-19 06:50:04,756 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:50:04,757 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:50:04,758 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:50:04,758 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:50:04,769 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:04" (1/1) ... [2024-11-19 06:50:04,769 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:04" (1/1) ... [2024-11-19 06:50:04,774 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:04" (1/1) ... [2024-11-19 06:50:04,826 INFO L175 MemorySlicer]: Split 36 memory accesses to 3 slices as follows [2, 29, 5]. 81 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2, 0]. The 17 writes are split as follows [0, 13, 4]. [2024-11-19 06:50:04,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:04" (1/1) ... [2024-11-19 06:50:04,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:04" (1/1) ... [2024-11-19 06:50:04,855 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:04" (1/1) ... [2024-11-19 06:50:04,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:04" (1/1) ... [2024-11-19 06:50:04,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:04" (1/1) ... [2024-11-19 06:50:04,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:04" (1/1) ... [2024-11-19 06:50:04,876 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:50:04,877 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:50:04,878 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:50:04,878 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:50:04,880 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:04" (1/1) ... [2024-11-19 06:50:04,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:50:04,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:50:04,917 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:50:04,919 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:50:04,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 06:50:04,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 06:50:04,967 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 06:50:04,968 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-11-19 06:50:04,968 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-11-19 06:50:04,968 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-19 06:50:04,968 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-19 06:50:04,968 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-19 06:50:04,968 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-19 06:50:04,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:50:04,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:50:04,969 INFO L130 BoogieDeclarations]: Found specification of procedure free_reports [2024-11-19 06:50:04,969 INFO L138 BoogieDeclarations]: Found implementation of procedure free_reports [2024-11-19 06:50:04,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:50:04,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:50:04,969 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:50:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 06:50:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:50:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:50:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 06:50:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 06:50:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 06:50:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 06:50:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:50:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 06:50:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 06:50:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 06:50:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2024-11-19 06:50:04,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2024-11-19 06:50:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-11-19 06:50:04,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-11-19 06:50:04,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:50:04,971 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:50:05,189 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:50:05,192 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:50:06,014 INFO L? ?]: Removed 247 outVars from TransFormulas that were not future-live. [2024-11-19 06:50:06,014 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:50:06,033 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:50:06,033 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 06:50:06,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:50:06 BoogieIcfgContainer [2024-11-19 06:50:06,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:50:06,036 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:50:06,037 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:50:06,040 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:50:06,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:50:03" (1/3) ... [2024-11-19 06:50:06,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c7c5b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:50:06, skipping insertion in model container [2024-11-19 06:50:06,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:04" (2/3) ... [2024-11-19 06:50:06,041 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76c7c5b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:50:06, skipping insertion in model container [2024-11-19 06:50:06,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:50:06" (3/3) ... [2024-11-19 06:50:06,042 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test23_1.i [2024-11-19 06:50:06,058 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:50:06,058 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 79 error locations. [2024-11-19 06:50:06,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:50:06,122 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;@67dd1c39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:50:06,122 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2024-11-19 06:50:06,129 INFO L276 IsEmpty]: Start isEmpty. Operand has 205 states, 111 states have (on average 1.8468468468468469) internal successors, (205), 190 states have internal predecessors, (205), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 06:50:06,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:50:06,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:06,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:06,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-19 06:50:06,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:06,144 INFO L85 PathProgramCache]: Analyzing trace with hash 441981202, now seen corresponding path program 1 times [2024-11-19 06:50:06,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:06,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205419424] [2024-11-19 06:50:06,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:06,157 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:06,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:06,162 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:50:06,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 06:50:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:06,282 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:50:06,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:06,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:50:06,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:50:06,446 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:06,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:06,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205419424] [2024-11-19 06:50:06,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205419424] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:06,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:06,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:50:06,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459348951] [2024-11-19 06:50:06,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:06,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:50:06,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:06,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:50:06,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:50:06,498 INFO L87 Difference]: Start difference. First operand has 205 states, 111 states have (on average 1.8468468468468469) internal successors, (205), 190 states have internal predecessors, (205), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:07,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:07,263 INFO L93 Difference]: Finished difference Result 221 states and 237 transitions. [2024-11-19 06:50:07,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:50:07,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 06:50:07,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:07,274 INFO L225 Difference]: With dead ends: 221 [2024-11-19 06:50:07,274 INFO L226 Difference]: Without dead ends: 219 [2024-11-19 06:50:07,276 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:50:07,286 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 10 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 848 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:07,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 848 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 06:50:07,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-19 06:50:07,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 212. [2024-11-19 06:50:07,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 117 states have (on average 1.794871794871795) internal successors, (210), 195 states have internal predecessors, (210), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-19 06:50:07,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 229 transitions. [2024-11-19 06:50:07,377 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 229 transitions. Word has length 12 [2024-11-19 06:50:07,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:07,377 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 229 transitions. [2024-11-19 06:50:07,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:07,378 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 229 transitions. [2024-11-19 06:50:07,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:50:07,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:07,379 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:07,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 06:50:07,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:07,582 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-19 06:50:07,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:07,584 INFO L85 PathProgramCache]: Analyzing trace with hash 441981203, now seen corresponding path program 1 times [2024-11-19 06:50:07,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:07,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407197740] [2024-11-19 06:50:07,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:07,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:07,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:07,591 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:50:07,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 06:50:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:07,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 06:50:07,680 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:07,697 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:50:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:50:07,812 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:07,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:07,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407197740] [2024-11-19 06:50:07,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1407197740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:07,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:07,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:50:07,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521823168] [2024-11-19 06:50:07,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:07,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:50:07,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:07,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:50:07,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:50:07,819 INFO L87 Difference]: Start difference. First operand 212 states and 229 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:08,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:08,619 INFO L93 Difference]: Finished difference Result 216 states and 231 transitions. [2024-11-19 06:50:08,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:50:08,620 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 06:50:08,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:08,624 INFO L225 Difference]: With dead ends: 216 [2024-11-19 06:50:08,626 INFO L226 Difference]: Without dead ends: 216 [2024-11-19 06:50:08,626 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:50:08,627 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 10 mSDsluCounter, 907 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:08,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1112 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 06:50:08,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-19 06:50:08,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 212. [2024-11-19 06:50:08,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 117 states have (on average 1.7777777777777777) internal successors, (208), 195 states have internal predecessors, (208), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2024-11-19 06:50:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 227 transitions. [2024-11-19 06:50:08,653 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 227 transitions. Word has length 12 [2024-11-19 06:50:08,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:08,654 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 227 transitions. [2024-11-19 06:50:08,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 227 transitions. [2024-11-19 06:50:08,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:50:08,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:08,655 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:08,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 06:50:08,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:08,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-19 06:50:08,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:08,857 INFO L85 PathProgramCache]: Analyzing trace with hash -2110175759, now seen corresponding path program 1 times [2024-11-19 06:50:08,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:08,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [904764455] [2024-11-19 06:50:08,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:08,858 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:08,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:08,861 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:50:08,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 06:50:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:08,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:50:08,964 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:50:09,041 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:09,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:09,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [904764455] [2024-11-19 06:50:09,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [904764455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:09,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:09,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:50:09,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470124362] [2024-11-19 06:50:09,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:09,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:50:09,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:09,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:50:09,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:50:09,043 INFO L87 Difference]: Start difference. First operand 212 states and 227 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:09,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:09,085 INFO L93 Difference]: Finished difference Result 203 states and 217 transitions. [2024-11-19 06:50:09,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:50:09,087 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2024-11-19 06:50:09,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:09,089 INFO L225 Difference]: With dead ends: 203 [2024-11-19 06:50:09,089 INFO L226 Difference]: Without dead ends: 203 [2024-11-19 06:50:09,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:50:09,090 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 0 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:09,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 841 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:50:09,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-19 06:50:09,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2024-11-19 06:50:09,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 113 states have (on average 1.7699115044247788) internal successors, (200), 187 states have internal predecessors, (200), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-19 06:50:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 217 transitions. [2024-11-19 06:50:09,111 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 217 transitions. Word has length 12 [2024-11-19 06:50:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:09,111 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 217 transitions. [2024-11-19 06:50:09,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:09,111 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 217 transitions. [2024-11-19 06:50:09,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:50:09,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:09,112 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:09,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-19 06:50:09,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:09,313 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-19 06:50:09,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:09,314 INFO L85 PathProgramCache]: Analyzing trace with hash 441895411, now seen corresponding path program 1 times [2024-11-19 06:50:09,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:09,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [133032553] [2024-11-19 06:50:09,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:09,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:09,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:09,318 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:50:09,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 06:50:09,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:09,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:50:09,402 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:09,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:50:09,434 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:09,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:09,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [133032553] [2024-11-19 06:50:09,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [133032553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:09,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:09,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:50:09,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036287694] [2024-11-19 06:50:09,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:09,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:50:09,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:09,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:50:09,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:50:09,436 INFO L87 Difference]: Start difference. First operand 203 states and 217 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:09,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:09,489 INFO L93 Difference]: Finished difference Result 204 states and 217 transitions. [2024-11-19 06:50:09,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:50:09,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 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 12 [2024-11-19 06:50:09,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:09,490 INFO L225 Difference]: With dead ends: 204 [2024-11-19 06:50:09,490 INFO L226 Difference]: Without dead ends: 204 [2024-11-19 06:50:09,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:50:09,491 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 106 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:09,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 711 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:50:09,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-19 06:50:09,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2024-11-19 06:50:09,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 113 states have (on average 1.761061946902655) internal successors, (199), 187 states have internal predecessors, (199), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-19 06:50:09,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 216 transitions. [2024-11-19 06:50:09,512 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 216 transitions. Word has length 12 [2024-11-19 06:50:09,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:09,512 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 216 transitions. [2024-11-19 06:50:09,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:09,513 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 216 transitions. [2024-11-19 06:50:09,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:50:09,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:09,514 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:09,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 06:50:09,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:09,717 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-19 06:50:09,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:09,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2110261550, now seen corresponding path program 1 times [2024-11-19 06:50:09,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:09,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140960941] [2024-11-19 06:50:09,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:09,718 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:09,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:09,721 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:50:09,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 06:50:09,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:09,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:50:09,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:09,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:50:09,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:09,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:09,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140960941] [2024-11-19 06:50:09,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140960941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:09,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:09,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:50:09,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225811360] [2024-11-19 06:50:09,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:09,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:50:09,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:09,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:50:09,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:50:09,835 INFO L87 Difference]: Start difference. First operand 203 states and 216 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:09,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:09,861 INFO L93 Difference]: Finished difference Result 205 states and 218 transitions. [2024-11-19 06:50:09,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:50:09,862 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 12 [2024-11-19 06:50:09,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:09,863 INFO L225 Difference]: With dead ends: 205 [2024-11-19 06:50:09,863 INFO L226 Difference]: Without dead ends: 205 [2024-11-19 06:50:09,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:50:09,864 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 100 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 722 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:09,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 722 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:50:09,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2024-11-19 06:50:09,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2024-11-19 06:50:09,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 115 states have (on average 1.7478260869565216) internal successors, (201), 189 states have internal predecessors, (201), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-19 06:50:09,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 218 transitions. [2024-11-19 06:50:09,872 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 218 transitions. Word has length 12 [2024-11-19 06:50:09,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:09,873 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 218 transitions. [2024-11-19 06:50:09,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:09,873 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 218 transitions. [2024-11-19 06:50:09,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:50:09,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:09,874 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:09,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 06:50:10,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:10,075 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-19 06:50:10,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:10,075 INFO L85 PathProgramCache]: Analyzing trace with hash -993578524, now seen corresponding path program 1 times [2024-11-19 06:50:10,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:10,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029457780] [2024-11-19 06:50:10,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:10,076 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:10,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:10,077 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:50:10,078 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 06:50:10,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:10,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:50:10,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:10,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:50:10,176 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:10,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:10,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029457780] [2024-11-19 06:50:10,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029457780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:10,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:10,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:50:10,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798217968] [2024-11-19 06:50:10,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:10,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:50:10,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:10,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:50:10,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:50:10,178 INFO L87 Difference]: Start difference. First operand 205 states and 218 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:10,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:10,539 INFO L93 Difference]: Finished difference Result 217 states and 232 transitions. [2024-11-19 06:50:10,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:50:10,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 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 13 [2024-11-19 06:50:10,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:10,540 INFO L225 Difference]: With dead ends: 217 [2024-11-19 06:50:10,540 INFO L226 Difference]: Without dead ends: 209 [2024-11-19 06:50:10,540 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:50:10,541 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 51 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:10,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 385 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:50:10,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-19 06:50:10,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 199. [2024-11-19 06:50:10,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 110 states have (on average 1.7727272727272727) internal successors, (195), 184 states have internal predecessors, (195), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-19 06:50:10,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 211 transitions. [2024-11-19 06:50:10,547 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 211 transitions. Word has length 13 [2024-11-19 06:50:10,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:10,548 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 211 transitions. [2024-11-19 06:50:10,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 06:50:10,548 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 211 transitions. [2024-11-19 06:50:10,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:50:10,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:10,548 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:10,553 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 (7)] Forceful destruction successful, exit code 0 [2024-11-19 06:50:10,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:10,752 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-19 06:50:10,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:10,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1884478057, now seen corresponding path program 1 times [2024-11-19 06:50:10,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:10,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733938413] [2024-11-19 06:50:10,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:10,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:10,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:10,755 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:50:10,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 06:50:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:10,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 06:50:10,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:10,975 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |ldv_malloc_#res.base| (select |c_#length| |ldv_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)))) is different from true [2024-11-19 06:50:11,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:50:11,043 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:50:11,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:50:11,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:11,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:11,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733938413] [2024-11-19 06:50:11,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733938413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:11,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:11,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:50:11,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89109388] [2024-11-19 06:50:11,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:11,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:50:11,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:11,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:50:11,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-11-19 06:50:11,116 INFO L87 Difference]: Start difference. First operand 199 states and 211 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:50:12,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:12,215 INFO L93 Difference]: Finished difference Result 249 states and 264 transitions. [2024-11-19 06:50:12,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:50:12,216 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2024-11-19 06:50:12,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:12,217 INFO L225 Difference]: With dead ends: 249 [2024-11-19 06:50:12,217 INFO L226 Difference]: Without dead ends: 249 [2024-11-19 06:50:12,218 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=76, Unknown=1, NotChecked=18, Total=132 [2024-11-19 06:50:12,218 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 301 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 262 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:12,219 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 324 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 639 Invalid, 0 Unknown, 262 Unchecked, 1.0s Time] [2024-11-19 06:50:12,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-19 06:50:12,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 208. [2024-11-19 06:50:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 192 states have internal predecessors, (208), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-19 06:50:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 226 transitions. [2024-11-19 06:50:12,227 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 226 transitions. Word has length 16 [2024-11-19 06:50:12,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:12,228 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 226 transitions. [2024-11-19 06:50:12,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:50:12,228 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 226 transitions. [2024-11-19 06:50:12,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 06:50:12,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:12,229 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] [2024-11-19 06:50:12,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 06:50:12,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:12,429 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-19 06:50:12,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:12,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1395272604, now seen corresponding path program 1 times [2024-11-19 06:50:12,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:12,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103663929] [2024-11-19 06:50:12,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:12,431 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:12,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:12,432 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:50:12,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 06:50:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:12,528 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:50:12,530 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:12,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:50:12,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:50:12,579 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:12,579 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:12,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103663929] [2024-11-19 06:50:12,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103663929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:12,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:12,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:50:12,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764169118] [2024-11-19 06:50:12,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:12,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:50:12,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:12,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:50:12,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:50:12,581 INFO L87 Difference]: Start difference. First operand 208 states and 226 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:50:13,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:13,104 INFO L93 Difference]: Finished difference Result 264 states and 291 transitions. [2024-11-19 06:50:13,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:50:13,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-11-19 06:50:13,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:13,106 INFO L225 Difference]: With dead ends: 264 [2024-11-19 06:50:13,106 INFO L226 Difference]: Without dead ends: 264 [2024-11-19 06:50:13,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:50:13,107 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 67 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:13,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 646 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:50:13,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-11-19 06:50:13,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 237. [2024-11-19 06:50:13,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 150 states have (on average 1.7666666666666666) internal successors, (265), 221 states have internal predecessors, (265), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2024-11-19 06:50:13,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 283 transitions. [2024-11-19 06:50:13,115 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 283 transitions. Word has length 25 [2024-11-19 06:50:13,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:13,116 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 283 transitions. [2024-11-19 06:50:13,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:50:13,116 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 283 transitions. [2024-11-19 06:50:13,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 06:50:13,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:13,119 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] [2024-11-19 06:50:13,123 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-11-19 06:50:13,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:13,319 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-19 06:50:13,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:13,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1395272603, now seen corresponding path program 1 times [2024-11-19 06:50:13,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:13,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232025269] [2024-11-19 06:50:13,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:13,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:13,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:13,323 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:50:13,324 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 06:50:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:13,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:50:13,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:13,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:50:13,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:50:13,521 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:13,521 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:13,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232025269] [2024-11-19 06:50:13,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232025269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:13,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:13,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:50:13,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339364166] [2024-11-19 06:50:13,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:13,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:50:13,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:13,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:50:13,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:50:13,523 INFO L87 Difference]: Start difference. First operand 237 states and 283 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:50:14,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:14,039 INFO L93 Difference]: Finished difference Result 262 states and 289 transitions. [2024-11-19 06:50:14,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:50:14,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2024-11-19 06:50:14,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:14,041 INFO L225 Difference]: With dead ends: 262 [2024-11-19 06:50:14,041 INFO L226 Difference]: Without dead ends: 262 [2024-11-19 06:50:14,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:50:14,042 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 64 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:14,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 681 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:50:14,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-19 06:50:14,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 238. [2024-11-19 06:50:14,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 152 states have (on average 1.75) internal successors, (266), 221 states have internal predecessors, (266), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-19 06:50:14,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 287 transitions. [2024-11-19 06:50:14,049 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 287 transitions. Word has length 25 [2024-11-19 06:50:14,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:14,049 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 287 transitions. [2024-11-19 06:50:14,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:50:14,049 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 287 transitions. [2024-11-19 06:50:14,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:50:14,050 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:14,050 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] [2024-11-19 06:50:14,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-19 06:50:14,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:14,251 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-19 06:50:14,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:14,251 INFO L85 PathProgramCache]: Analyzing trace with hash -827103092, now seen corresponding path program 1 times [2024-11-19 06:50:14,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:14,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120843799] [2024-11-19 06:50:14,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:14,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:14,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:14,253 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:50:14,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 06:50:14,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:14,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:50:14,363 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:14,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:50:14,394 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:14,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:14,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120843799] [2024-11-19 06:50:14,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120843799] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:14,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:14,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:50:14,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236036781] [2024-11-19 06:50:14,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:14,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:50:14,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:14,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:50:14,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:50:14,396 INFO L87 Difference]: Start difference. First operand 238 states and 287 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:50:14,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:14,488 INFO L93 Difference]: Finished difference Result 238 states and 286 transitions. [2024-11-19 06:50:14,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:50:14,499 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2024-11-19 06:50:14,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:14,500 INFO L225 Difference]: With dead ends: 238 [2024-11-19 06:50:14,501 INFO L226 Difference]: Without dead ends: 238 [2024-11-19 06:50:14,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:50:14,502 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 83 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:14,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 863 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:50:14,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-19 06:50:14,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-11-19 06:50:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 152 states have (on average 1.743421052631579) internal successors, (265), 221 states have internal predecessors, (265), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-19 06:50:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 286 transitions. [2024-11-19 06:50:14,509 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 286 transitions. Word has length 27 [2024-11-19 06:50:14,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:14,509 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 286 transitions. [2024-11-19 06:50:14,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:50:14,509 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 286 transitions. [2024-11-19 06:50:14,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 06:50:14,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:14,510 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] [2024-11-19 06:50:14,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-19 06:50:14,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:14,711 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-19 06:50:14,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:14,711 INFO L85 PathProgramCache]: Analyzing trace with hash 28296912, now seen corresponding path program 1 times [2024-11-19 06:50:14,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:14,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [248820072] [2024-11-19 06:50:14,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:14,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:14,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:14,713 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:50:14,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 06:50:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:14,882 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:50:14,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:14,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:50:14,949 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 06:50:14,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-19 06:50:15,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:50:15,007 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:15,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:15,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [248820072] [2024-11-19 06:50:15,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [248820072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:15,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:15,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:50:15,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912439537] [2024-11-19 06:50:15,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:15,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:50:15,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:15,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:50:15,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:50:15,010 INFO L87 Difference]: Start difference. First operand 238 states and 286 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:50:15,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:15,767 INFO L93 Difference]: Finished difference Result 249 states and 293 transitions. [2024-11-19 06:50:15,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:50:15,768 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-11-19 06:50:15,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:15,769 INFO L225 Difference]: With dead ends: 249 [2024-11-19 06:50:15,769 INFO L226 Difference]: Without dead ends: 249 [2024-11-19 06:50:15,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:50:15,770 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 134 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:15,770 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 567 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-19 06:50:15,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2024-11-19 06:50:15,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 233. [2024-11-19 06:50:15,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 152 states have (on average 1.6776315789473684) internal successors, (255), 216 states have internal predecessors, (255), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-19 06:50:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 276 transitions. [2024-11-19 06:50:15,784 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 276 transitions. Word has length 33 [2024-11-19 06:50:15,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:15,784 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 276 transitions. [2024-11-19 06:50:15,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:50:15,785 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 276 transitions. [2024-11-19 06:50:15,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 06:50:15,785 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:15,787 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] [2024-11-19 06:50:15,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 06:50:15,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:15,988 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-19 06:50:15,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:15,988 INFO L85 PathProgramCache]: Analyzing trace with hash 28296913, now seen corresponding path program 1 times [2024-11-19 06:50:15,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:15,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970676111] [2024-11-19 06:50:15,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:15,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:15,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:15,993 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:50:15,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 06:50:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:16,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 06:50:16,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:16,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:50:16,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:50:16,264 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_zalloc_#t~malloc13#1.base|)) (= |c_#length| (store |c_old(#length)| |ldv_zalloc_#t~malloc13#1.base| (select |c_#length| |ldv_zalloc_#t~malloc13#1.base|))))) is different from true [2024-11-19 06:50:16,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:50:16,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:50:16,302 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:50:16,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 06:50:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:50:16,381 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:16,382 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:16,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970676111] [2024-11-19 06:50:16,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970676111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:16,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:16,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:50:16,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565769412] [2024-11-19 06:50:16,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:16,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:50:16,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:16,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:50:16,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2024-11-19 06:50:16,383 INFO L87 Difference]: Start difference. First operand 233 states and 276 transitions. Second operand has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:50:17,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:17,153 INFO L93 Difference]: Finished difference Result 283 states and 311 transitions. [2024-11-19 06:50:17,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:50:17,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2024-11-19 06:50:17,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:17,155 INFO L225 Difference]: With dead ends: 283 [2024-11-19 06:50:17,156 INFO L226 Difference]: Without dead ends: 283 [2024-11-19 06:50:17,156 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=37, Unknown=1, NotChecked=12, Total=72 [2024-11-19 06:50:17,156 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 173 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 317 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:17,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 394 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 407 Invalid, 0 Unknown, 317 Unchecked, 0.7s Time] [2024-11-19 06:50:17,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2024-11-19 06:50:17,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 233. [2024-11-19 06:50:17,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 152 states have (on average 1.644736842105263) internal successors, (250), 216 states have internal predecessors, (250), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-19 06:50:17,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 271 transitions. [2024-11-19 06:50:17,166 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 271 transitions. Word has length 33 [2024-11-19 06:50:17,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:17,166 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 271 transitions. [2024-11-19 06:50:17,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:50:17,166 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 271 transitions. [2024-11-19 06:50:17,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 06:50:17,167 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:17,167 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] [2024-11-19 06:50:17,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 06:50:17,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:17,372 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-19 06:50:17,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:17,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1178496149, now seen corresponding path program 1 times [2024-11-19 06:50:17,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:17,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [945001390] [2024-11-19 06:50:17,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:17,373 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:17,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:17,376 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:50:17,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 06:50:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:17,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 06:50:17,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:17,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:50:17,956 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:17,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:17,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [945001390] [2024-11-19 06:50:17,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [945001390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:17,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:17,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:50:17,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076602257] [2024-11-19 06:50:17,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:17,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:50:17,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:17,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:50:17,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:50:17,958 INFO L87 Difference]: Start difference. First operand 233 states and 271 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:50:18,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:18,375 INFO L93 Difference]: Finished difference Result 231 states and 268 transitions. [2024-11-19 06:50:18,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:50:18,376 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2024-11-19 06:50:18,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:18,377 INFO L225 Difference]: With dead ends: 231 [2024-11-19 06:50:18,377 INFO L226 Difference]: Without dead ends: 231 [2024-11-19 06:50:18,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:50:18,378 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 224 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:18,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 728 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:50:18,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-19 06:50:18,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2024-11-19 06:50:18,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 152 states have (on average 1.625) internal successors, (247), 214 states have internal predecessors, (247), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-19 06:50:18,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 268 transitions. [2024-11-19 06:50:18,388 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 268 transitions. Word has length 36 [2024-11-19 06:50:18,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:18,389 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 268 transitions. [2024-11-19 06:50:18,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:50:18,389 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 268 transitions. [2024-11-19 06:50:18,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 06:50:18,391 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:18,391 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] [2024-11-19 06:50:18,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-19 06:50:18,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:18,592 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONARRAY_INDEX === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-19 06:50:18,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:18,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1178495961, now seen corresponding path program 1 times [2024-11-19 06:50:18,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:18,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187873692] [2024-11-19 06:50:18,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:18,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:18,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:18,597 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:50:18,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 06:50:18,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:18,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:50:18,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:50:18,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:18,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:18,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187873692] [2024-11-19 06:50:18,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187873692] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:18,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:18,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:50:18,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202060408] [2024-11-19 06:50:18,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:18,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:50:18,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:18,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:50:18,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:50:18,763 INFO L87 Difference]: Start difference. First operand 231 states and 268 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:50:18,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:18,779 INFO L93 Difference]: Finished difference Result 235 states and 272 transitions. [2024-11-19 06:50:18,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:50:18,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2024-11-19 06:50:18,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:18,782 INFO L225 Difference]: With dead ends: 235 [2024-11-19 06:50:18,782 INFO L226 Difference]: Without dead ends: 235 [2024-11-19 06:50:18,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:50:18,783 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:18,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 579 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:50:18,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-19 06:50:18,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2024-11-19 06:50:18,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 156 states have (on average 1.608974358974359) internal successors, (251), 218 states have internal predecessors, (251), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-19 06:50:18,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 272 transitions. [2024-11-19 06:50:18,790 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 272 transitions. Word has length 36 [2024-11-19 06:50:18,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:18,791 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 272 transitions. [2024-11-19 06:50:18,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:50:18,791 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 272 transitions. [2024-11-19 06:50:18,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 06:50:18,792 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:18,792 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:18,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-19 06:50:18,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:18,993 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-19 06:50:18,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:18,993 INFO L85 PathProgramCache]: Analyzing trace with hash -237820889, now seen corresponding path program 1 times [2024-11-19 06:50:18,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:18,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971333105] [2024-11-19 06:50:18,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:18,994 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:18,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:18,997 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:50:18,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 06:50:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:19,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:50:19,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:50:19,157 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:19,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:19,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971333105] [2024-11-19 06:50:19,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971333105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:19,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:19,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:50:19,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118487754] [2024-11-19 06:50:19,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:19,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:50:19,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:19,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:50:19,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:50:19,159 INFO L87 Difference]: Start difference. First operand 235 states and 272 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:50:19,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:19,177 INFO L93 Difference]: Finished difference Result 237 states and 274 transitions. [2024-11-19 06:50:19,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:50:19,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2024-11-19 06:50:19,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:19,179 INFO L225 Difference]: With dead ends: 237 [2024-11-19 06:50:19,179 INFO L226 Difference]: Without dead ends: 237 [2024-11-19 06:50:19,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:50:19,180 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:19,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 578 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:50:19,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-19 06:50:19,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2024-11-19 06:50:19,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 158 states have (on average 1.6012658227848102) internal successors, (253), 220 states have internal predecessors, (253), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-19 06:50:19,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 274 transitions. [2024-11-19 06:50:19,186 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 274 transitions. Word has length 40 [2024-11-19 06:50:19,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:19,186 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 274 transitions. [2024-11-19 06:50:19,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:50:19,186 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 274 transitions. [2024-11-19 06:50:19,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 06:50:19,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:19,187 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] [2024-11-19 06:50:19,192 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-11-19 06:50:19,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:19,388 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-19 06:50:19,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:19,389 INFO L85 PathProgramCache]: Analyzing trace with hash -912533233, now seen corresponding path program 1 times [2024-11-19 06:50:19,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:19,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261162631] [2024-11-19 06:50:19,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:19,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:19,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:19,392 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:50:19,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-19 06:50:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:19,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 06:50:19,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:19,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:50:19,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:50:19,822 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:50:19,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 06:50:20,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:50:20,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:50:20,320 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 06:50:20,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-19 06:50:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:50:20,566 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:20,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:20,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261162631] [2024-11-19 06:50:20,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261162631] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:20,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:20,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:50:20,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020652244] [2024-11-19 06:50:20,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:20,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:50:20,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:20,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:50:20,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:50:20,568 INFO L87 Difference]: Start difference. First operand 237 states and 274 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:50:23,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:23,613 INFO L93 Difference]: Finished difference Result 267 states and 304 transitions. [2024-11-19 06:50:23,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:50:23,613 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2024-11-19 06:50:23,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:23,614 INFO L225 Difference]: With dead ends: 267 [2024-11-19 06:50:23,614 INFO L226 Difference]: Without dead ends: 267 [2024-11-19 06:50:23,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:50:23,616 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 613 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 993 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 613 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:23,616 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [613 Valid, 499 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 993 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-19 06:50:23,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-19 06:50:23,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 237. [2024-11-19 06:50:23,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 160 states have (on average 1.58125) internal successors, (253), 219 states have internal predecessors, (253), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-19 06:50:23,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 274 transitions. [2024-11-19 06:50:23,624 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 274 transitions. Word has length 42 [2024-11-19 06:50:23,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:23,624 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 274 transitions. [2024-11-19 06:50:23,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:50:23,624 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 274 transitions. [2024-11-19 06:50:23,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 06:50:23,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:23,626 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] [2024-11-19 06:50:23,633 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-19 06:50:23,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:23,827 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-19 06:50:23,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:23,827 INFO L85 PathProgramCache]: Analyzing trace with hash -912533234, now seen corresponding path program 1 times [2024-11-19 06:50:23,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:23,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1023386501] [2024-11-19 06:50:23,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:23,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:23,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:23,829 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:50:23,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-19 06:50:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:24,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 06:50:24,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:24,123 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-19 06:50:24,123 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 21 treesize of output 20 [2024-11-19 06:50:24,239 INFO L349 Elim1Store]: treesize reduction 28, result has 45.1 percent of original size [2024-11-19 06:50:24,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 33 [2024-11-19 06:50:24,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2024-11-19 06:50:24,546 INFO L349 Elim1Store]: treesize reduction 28, result has 60.6 percent of original size [2024-11-19 06:50:24,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 64 [2024-11-19 06:50:25,157 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-19 06:50:25,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:50:25,172 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:50:25,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2024-11-19 06:50:25,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:50:25,233 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:25,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:25,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1023386501] [2024-11-19 06:50:25,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1023386501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:25,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:25,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 06:50:25,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543829512] [2024-11-19 06:50:25,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:25,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:50:25,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:25,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:50:25,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:50:25,235 INFO L87 Difference]: Start difference. First operand 237 states and 274 transitions. Second operand has 14 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:50:28,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:28,155 INFO L93 Difference]: Finished difference Result 330 states and 366 transitions. [2024-11-19 06:50:28,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:50:28,155 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 42 [2024-11-19 06:50:28,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:28,156 INFO L225 Difference]: With dead ends: 330 [2024-11-19 06:50:28,157 INFO L226 Difference]: Without dead ends: 330 [2024-11-19 06:50:28,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=537, Unknown=0, NotChecked=0, Total=650 [2024-11-19 06:50:28,157 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 324 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:28,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 940 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-19 06:50:28,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-19 06:50:28,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 246. [2024-11-19 06:50:28,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 169 states have (on average 1.5739644970414202) internal successors, (266), 226 states have internal predecessors, (266), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-19 06:50:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 287 transitions. [2024-11-19 06:50:28,164 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 287 transitions. Word has length 42 [2024-11-19 06:50:28,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:28,164 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 287 transitions. [2024-11-19 06:50:28,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:50:28,164 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 287 transitions. [2024-11-19 06:50:28,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 06:50:28,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:28,165 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] [2024-11-19 06:50:28,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-19 06:50:28,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:28,366 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_LEAK === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-19 06:50:28,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:28,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1776260935, now seen corresponding path program 1 times [2024-11-19 06:50:28,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:28,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094110960] [2024-11-19 06:50:28,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:28,367 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:28,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:28,370 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:50:28,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-19 06:50:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:28,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:50:28,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:28,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:50:28,529 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:28,529 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:28,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094110960] [2024-11-19 06:50:28,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094110960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:28,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:28,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:50:28,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078011724] [2024-11-19 06:50:28,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:28,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:50:28,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:28,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:50:28,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:50:28,531 INFO L87 Difference]: Start difference. First operand 246 states and 287 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:50:28,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:28,547 INFO L93 Difference]: Finished difference Result 248 states and 288 transitions. [2024-11-19 06:50:28,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:50:28,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2024-11-19 06:50:28,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:28,548 INFO L225 Difference]: With dead ends: 248 [2024-11-19 06:50:28,548 INFO L226 Difference]: Without dead ends: 248 [2024-11-19 06:50:28,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:50:28,549 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 0 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:28,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 573 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:50:28,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-19 06:50:28,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2024-11-19 06:50:28,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 171 states have (on average 1.5614035087719298) internal successors, (267), 228 states have internal predecessors, (267), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-19 06:50:28,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 288 transitions. [2024-11-19 06:50:28,567 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 288 transitions. Word has length 43 [2024-11-19 06:50:28,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:28,568 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 288 transitions. [2024-11-19 06:50:28,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:50:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 288 transitions. [2024-11-19 06:50:28,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 06:50:28,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:28,569 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] [2024-11-19 06:50:28,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-19 06:50:28,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:28,769 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONARRAY_INDEX === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-19 06:50:28,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:28,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1205855897, now seen corresponding path program 1 times [2024-11-19 06:50:28,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:28,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092939014] [2024-11-19 06:50:28,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:28,770 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:28,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:28,772 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:50:28,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2024-11-19 06:50:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:29,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 06:50:29,014 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:29,047 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:50:29,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:50:29,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:50:29,050 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:50:29,051 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:50:29,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2024-11-19 06:50:29,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 21 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 60 [2024-11-19 06:50:30,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 36 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 96 [2024-11-19 06:50:34,799 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:50:34,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 133 treesize of output 105 [2024-11-19 06:50:38,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:50:38,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 112 treesize of output 42 [2024-11-19 06:50:38,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:50:38,751 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:38,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:38,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092939014] [2024-11-19 06:50:38,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092939014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:38,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:38,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:50:38,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070258643] [2024-11-19 06:50:38,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:38,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:50:38,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:38,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:50:38,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=31, Unknown=5, NotChecked=0, Total=56 [2024-11-19 06:50:38,753 INFO L87 Difference]: Start difference. First operand 248 states and 288 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:50:42,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:50:46,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:50:50,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:50:52,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:50:54,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:50:56,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:51:00,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:51:04,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:51:05,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:51:07,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:51:12,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:51:16,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:51:20,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:51:22,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:51:25,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:51:25,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:25,267 INFO L93 Difference]: Finished difference Result 255 states and 295 transitions. [2024-11-19 06:51:25,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:51:25,268 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2024-11-19 06:51:25,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:25,269 INFO L225 Difference]: With dead ends: 255 [2024-11-19 06:51:25,269 INFO L226 Difference]: Without dead ends: 255 [2024-11-19 06:51:25,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=24, Invalid=43, Unknown=5, NotChecked=0, Total=72 [2024-11-19 06:51:25,270 INFO L432 NwaCegarLoop]: 189 mSDtfsCounter, 58 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 1 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:25,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 838 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 86 Invalid, 15 Unknown, 0 Unchecked, 46.4s Time] [2024-11-19 06:51:25,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-19 06:51:25,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 247. [2024-11-19 06:51:25,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 171 states have (on average 1.5497076023391814) internal successors, (265), 227 states have internal predecessors, (265), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 12 states have call predecessors, (12), 9 states have call successors, (12) [2024-11-19 06:51:25,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 286 transitions. [2024-11-19 06:51:25,281 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 286 transitions. Word has length 44 [2024-11-19 06:51:25,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:25,282 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 286 transitions. [2024-11-19 06:51:25,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:51:25,282 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 286 transitions. [2024-11-19 06:51:25,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 06:51:25,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:25,283 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] [2024-11-19 06:51:25,294 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-11-19 06:51:25,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:51:25,484 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-19 06:51:25,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:25,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1865662331, now seen corresponding path program 1 times [2024-11-19 06:51:25,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:51:25,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842900190] [2024-11-19 06:51:25,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:25,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:51:25,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:51:25,486 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:51:25,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2024-11-19 06:51:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:25,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-19 06:51:25,703 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:51:25,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:51:25,875 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 15 treesize of output 1 [2024-11-19 06:51:25,934 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-11-19 06:51:25,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 44 [2024-11-19 06:51:25,994 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-19 06:51:25,994 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 19 treesize of output 11 [2024-11-19 06:51:26,246 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-11-19 06:51:26,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 32 treesize of output 44