./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.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_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:49:59,295 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:49:59,355 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:59,358 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:49:59,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:49:59,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:49:59,383 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:49:59,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:49:59,384 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:49:59,384 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:49:59,385 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:49:59,385 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:49:59,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:49:59,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:49:59,386 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:49:59,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:49:59,386 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:49:59,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:49:59,387 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:49:59,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:49:59,388 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:49:59,388 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:49:59,388 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:49:59,388 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:49:59,389 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:49:59,389 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:49:59,389 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:49:59,389 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:49:59,390 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:49:59,390 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:49:59,390 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:49:59,390 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:49:59,390 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:49:59,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:49:59,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:49:59,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:49:59,391 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:49:59,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:49:59,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:49:59,392 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:49:59,392 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:49:59,392 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:49:59,392 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 -> 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 [2024-11-19 06:49:59,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:49:59,583 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:49:59,586 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:49:59,587 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:49:59,587 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:49:59,588 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2024-11-19 06:50:00,760 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:50:00,966 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:50:00,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2024-11-19 06:50:00,985 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb53bd708/b1bc9258c36b4eb0ac93e84975469349/FLAGe97218519 [2024-11-19 06:50:01,323 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb53bd708/b1bc9258c36b4eb0ac93e84975469349 [2024-11-19 06:50:01,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:50:01,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:50:01,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:50:01,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:50:01,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:50:01,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:50:01" (1/1) ... [2024-11-19 06:50:01,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3017c4ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:01, skipping insertion in model container [2024-11-19 06:50:01,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:50:01" (1/1) ... [2024-11-19 06:50:01,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:50:01,659 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:01,719 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:50:01,721 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:50:01,742 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:50:01,743 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@153b4e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:01, skipping insertion in model container [2024-11-19 06:50:01,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:50:01,744 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 06:50:01,745 INFO L158 Benchmark]: Toolchain (without parser) took 417.88ms. Allocated memory is still 211.8MB. Free memory was 185.0MB in the beginning and 168.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 06:50:01,746 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:50:01,746 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.20ms. Allocated memory is still 211.8MB. Free memory was 185.0MB in the beginning and 168.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 06:50:01,748 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.15ms. Allocated memory is still 155.2MB. Free memory is still 106.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.20ms. Allocated memory is still 211.8MB. Free memory was 185.0MB in the beginning and 168.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:50:03,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:50:03,369 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:03,373 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:50:03,373 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:50:03,397 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:50:03,399 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:50:03,399 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:50:03,400 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:50:03,401 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:50:03,401 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:50:03,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:50:03,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:50:03,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:50:03,403 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:50:03,405 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:50:03,405 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:50:03,405 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:50:03,405 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:50:03,406 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:50:03,406 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:50:03,406 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:50:03,406 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:50:03,407 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:50:03,407 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:50:03,407 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:50:03,407 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:50:03,407 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:50:03,407 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:50:03,407 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:50:03,408 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:50:03,408 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:50:03,408 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:50:03,408 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:50:03,408 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:50:03,408 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:50:03,409 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:50:03,409 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:50:03,409 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:50:03,409 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:50:03,409 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:50:03,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:50:03,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:50:03,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:50:03,412 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 -> 8821dcf0dd649f568f6a7cfce8600f412ab79c37bc3c7c7e65db385cdb052111 [2024-11-19 06:50:03,672 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:50:03,691 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:50:03,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:50:03,694 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:50:03,694 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:50:03,696 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2024-11-19 06:50:04,919 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:50:05,153 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:50:05,153 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_2.i [2024-11-19 06:50:05,171 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6267dd21f/525aa37a35754e6ca5e89cdeb97029ff/FLAGcf6ec3085 [2024-11-19 06:50:05,485 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6267dd21f/525aa37a35754e6ca5e89cdeb97029ff [2024-11-19 06:50:05,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:50:05,488 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:50:05,489 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:50:05,489 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:50:05,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:50:05,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:50:05" (1/1) ... [2024-11-19 06:50:05,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd089ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:05, skipping insertion in model container [2024-11-19 06:50:05,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:50:05" (1/1) ... [2024-11-19 06:50:05,537 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:50:05,822 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:05,888 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:05,891 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:50:05,908 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 06:50:05,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:50:05,945 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:05,963 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:05,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:50:05,971 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:50:06,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:50:06,066 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:50:06,066 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:06 WrapperNode [2024-11-19 06:50:06,066 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:50:06,067 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:50:06,067 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:50:06,067 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:50:06,072 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:06" (1/1) ... [2024-11-19 06:50:06,092 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:06" (1/1) ... [2024-11-19 06:50:06,115 INFO L138 Inliner]: procedures = 175, calls = 119, calls flagged for inlining = 30, calls inlined = 15, statements flattened = 200 [2024-11-19 06:50:06,116 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:50:06,116 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:50:06,116 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:50:06,116 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:50:06,127 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:06" (1/1) ... [2024-11-19 06:50:06,127 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:06" (1/1) ... [2024-11-19 06:50:06,133 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:06" (1/1) ... [2024-11-19 06:50:06,168 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:06,168 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:06" (1/1) ... [2024-11-19 06:50:06,168 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:06" (1/1) ... [2024-11-19 06:50:06,187 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:06" (1/1) ... [2024-11-19 06:50:06,204 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:06" (1/1) ... [2024-11-19 06:50:06,206 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:06" (1/1) ... [2024-11-19 06:50:06,212 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:06" (1/1) ... [2024-11-19 06:50:06,218 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:50:06,220 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:50:06,220 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:50:06,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:50:06,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:06" (1/1) ... [2024-11-19 06:50:06,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:50:06,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:50:06,248 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:06,250 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:06,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 06:50:06,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 06:50:06,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 06:50:06,279 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2024-11-19 06:50:06,279 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2024-11-19 06:50:06,279 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-19 06:50:06,279 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-19 06:50:06,279 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-11-19 06:50:06,279 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-11-19 06:50:06,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:50:06,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:50:06,280 INFO L130 BoogieDeclarations]: Found specification of procedure free_reports [2024-11-19 06:50:06,280 INFO L138 BoogieDeclarations]: Found implementation of procedure free_reports [2024-11-19 06:50:06,280 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 06:50:06,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:50:06,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:50:06,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 06:50:06,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:50:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:50:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 06:50:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 06:50:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 06:50:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 06:50:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:50:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 06:50:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 06:50:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 06:50:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2024-11-19 06:50:06,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2024-11-19 06:50:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2024-11-19 06:50:06,282 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2024-11-19 06:50:06,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:50:06,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:50:06,450 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:50:06,452 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:50:06,983 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-11-19 06:50:06,983 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:50:07,002 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:50:07,004 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 06:50:07,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:50:07 BoogieIcfgContainer [2024-11-19 06:50:07,004 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:50:07,006 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:50:07,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:50:07,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:50:07,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:50:05" (1/3) ... [2024-11-19 06:50:07,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392a108e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:50:07, skipping insertion in model container [2024-11-19 06:50:07,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:50:06" (2/3) ... [2024-11-19 06:50:07,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392a108e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:50:07, skipping insertion in model container [2024-11-19 06:50:07,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:50:07" (3/3) ... [2024-11-19 06:50:07,011 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test23_2.i [2024-11-19 06:50:07,023 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:50:07,023 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 79 error locations. [2024-11-19 06:50:07,065 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:50:07,071 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;@34eabb44, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:50:07,071 INFO L334 AbstractCegarLoop]: Starting to check reachability of 79 error locations. [2024-11-19 06:50:07,076 INFO L276 IsEmpty]: Start isEmpty. Operand has 204 states, 110 states have (on average 1.8454545454545455) internal successors, (203), 189 states have internal predecessors, (203), 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:07,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:50:07,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:07,081 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:07,082 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:07,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:07,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1281398167, now seen corresponding path program 1 times [2024-11-19 06:50:07,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:07,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63168282] [2024-11-19 06:50:07,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:07,097 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,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:07,100 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:07,101 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:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:07,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:50:07,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:07,255 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:07,311 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,311 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:07,312 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:07,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63168282] [2024-11-19 06:50:07,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63168282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:07,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:07,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:50:07,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151004495] [2024-11-19 06:50:07,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:07,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:50:07,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:07,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:50:07,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:50:07,346 INFO L87 Difference]: Start difference. First operand has 204 states, 110 states have (on average 1.8454545454545455) internal successors, (203), 189 states have internal predecessors, (203), 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,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:07,951 INFO L93 Difference]: Finished difference Result 220 states and 235 transitions. [2024-11-19 06:50:07,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:50:07,954 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,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:07,961 INFO L225 Difference]: With dead ends: 220 [2024-11-19 06:50:07,961 INFO L226 Difference]: Without dead ends: 218 [2024-11-19 06:50:07,963 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:50:07,966 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 10 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 842 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.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:07,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 842 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:50:07,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-19 06:50:07,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 211. [2024-11-19 06:50:07,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 116 states have (on average 1.793103448275862) internal successors, (208), 194 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,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 227 transitions. [2024-11-19 06:50:08,001 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 227 transitions. Word has length 12 [2024-11-19 06:50:08,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:08,001 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 227 transitions. [2024-11-19 06:50:08,001 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:08,001 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 227 transitions. [2024-11-19 06:50:08,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:50:08,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:08,002 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:08,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-19 06:50:08,202 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:08,203 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:08,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:08,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1281398168, now seen corresponding path program 1 times [2024-11-19 06:50:08,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:08,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723298934] [2024-11-19 06:50:08,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:08,205 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,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:08,206 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:08,207 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:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:08,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 06:50:08,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:08,300 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:08,393 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:08,393 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:08,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:08,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723298934] [2024-11-19 06:50:08,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [723298934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:08,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:08,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:50:08,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141684273] [2024-11-19 06:50:08,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:08,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:50:08,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:08,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:50:08,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:50:08,406 INFO L87 Difference]: Start difference. First operand 211 states and 227 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,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:08,948 INFO L93 Difference]: Finished difference Result 215 states and 229 transitions. [2024-11-19 06:50:08,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:50:08,948 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,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:08,949 INFO L225 Difference]: With dead ends: 215 [2024-11-19 06:50:08,950 INFO L226 Difference]: Without dead ends: 215 [2024-11-19 06:50:08,950 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,950 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 10 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 1098 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.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:08,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 1098 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:50:08,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-19 06:50:08,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 211. [2024-11-19 06:50:08,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 116 states have (on average 1.7758620689655173) internal successors, (206), 194 states have internal predecessors, (206), 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,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 225 transitions. [2024-11-19 06:50:08,962 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 225 transitions. Word has length 12 [2024-11-19 06:50:08,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:08,962 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 225 transitions. [2024-11-19 06:50:08,962 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,962 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 225 transitions. [2024-11-19 06:50:08,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:50:08,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:08,963 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:08,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 06:50:09,165 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:09,165 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:09,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:09,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1270758794, now seen corresponding path program 1 times [2024-11-19 06:50:09,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:09,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [670038189] [2024-11-19 06:50:09,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:09,166 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,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:09,167 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:09,168 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:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:09,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:50:09,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:09,285 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,285 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:09,285 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:09,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [670038189] [2024-11-19 06:50:09,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [670038189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:09,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:09,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:50:09,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402854096] [2024-11-19 06:50:09,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:09,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:50:09,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:09,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:50:09,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:50:09,286 INFO L87 Difference]: Start difference. First operand 211 states and 225 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,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:09,317 INFO L93 Difference]: Finished difference Result 202 states and 215 transitions. [2024-11-19 06:50:09,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:50:09,317 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,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:09,318 INFO L225 Difference]: With dead ends: 202 [2024-11-19 06:50:09,318 INFO L226 Difference]: Without dead ends: 202 [2024-11-19 06:50:09,318 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,319 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 0 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 833 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,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 833 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,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-19 06:50:09,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2024-11-19 06:50:09,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 112 states have (on average 1.7678571428571428) internal successors, (198), 186 states have internal predecessors, (198), 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,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 215 transitions. [2024-11-19 06:50:09,335 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 215 transitions. Word has length 12 [2024-11-19 06:50:09,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:09,335 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 215 transitions. [2024-11-19 06:50:09,335 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,335 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 215 transitions. [2024-11-19 06:50:09,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:50:09,336 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:09,336 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:09,341 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,536 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,536 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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:09,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:09,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1281312215, now seen corresponding path program 1 times [2024-11-19 06:50:09,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:09,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [813268212] [2024-11-19 06:50:09,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:09,537 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,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:09,540 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,540 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,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:09,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:50:09,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:09,617 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,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:09,618 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:09,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [813268212] [2024-11-19 06:50:09,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [813268212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:09,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:09,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:50:09,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199434809] [2024-11-19 06:50:09,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:09,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:50:09,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:09,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:50:09,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:50:09,620 INFO L87 Difference]: Start difference. First operand 202 states and 215 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,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:09,648 INFO L93 Difference]: Finished difference Result 203 states and 215 transitions. [2024-11-19 06:50:09,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:50:09,649 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,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:09,650 INFO L225 Difference]: With dead ends: 203 [2024-11-19 06:50:09,650 INFO L226 Difference]: Without dead ends: 203 [2024-11-19 06:50:09,650 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,651 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 104 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 705 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,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 705 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,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-19 06:50:09,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 202. [2024-11-19 06:50:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 186 states have internal predecessors, (197), 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,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 214 transitions. [2024-11-19 06:50:09,663 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 214 transitions. Word has length 12 [2024-11-19 06:50:09,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:09,663 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 214 transitions. [2024-11-19 06:50:09,663 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,663 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 214 transitions. [2024-11-19 06:50:09,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-19 06:50:09,664 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:09,664 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:09,669 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,864 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,865 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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:09,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:09,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1270844746, now seen corresponding path program 1 times [2024-11-19 06:50:09,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:09,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [789996352] [2024-11-19 06:50:09,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:09,866 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,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:09,867 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,868 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,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:09,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:50:09,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:09,953 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,953 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:09,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:09,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [789996352] [2024-11-19 06:50:09,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [789996352] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:09,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:09,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:50:09,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836125700] [2024-11-19 06:50:09,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:09,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:50:09,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:09,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:50:09,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:50:09,955 INFO L87 Difference]: Start difference. First operand 202 states and 214 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,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:09,973 INFO L93 Difference]: Finished difference Result 204 states and 216 transitions. [2024-11-19 06:50:09,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:50:09,973 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,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:09,974 INFO L225 Difference]: With dead ends: 204 [2024-11-19 06:50:09,974 INFO L226 Difference]: Without dead ends: 204 [2024-11-19 06:50:09,975 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,975 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 98 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 716 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,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 716 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,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-19 06:50:09,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2024-11-19 06:50:09,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 114 states have (on average 1.7456140350877194) internal successors, (199), 188 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,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 216 transitions. [2024-11-19 06:50:09,980 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 216 transitions. Word has length 12 [2024-11-19 06:50:09,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:09,981 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 216 transitions. [2024-11-19 06:50:09,981 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,981 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 216 transitions. [2024-11-19 06:50:09,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 06:50:09,981 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:09,981 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:09,984 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,183 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,184 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,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:10,184 INFO L85 PathProgramCache]: Analyzing trace with hash -741461350, now seen corresponding path program 1 times [2024-11-19 06:50:10,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:10,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724638661] [2024-11-19 06:50:10,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:10,185 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:10,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:10,186 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,187 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,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:10,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:50:10,236 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:10,257 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,257 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:10,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:10,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724638661] [2024-11-19 06:50:10,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724638661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:10,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:10,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:50:10,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28658101] [2024-11-19 06:50:10,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:10,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:50:10,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:10,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:50:10,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:50:10,259 INFO L87 Difference]: Start difference. First operand 204 states and 216 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,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:10,508 INFO L93 Difference]: Finished difference Result 216 states and 230 transitions. [2024-11-19 06:50:10,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:50:10,508 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,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:10,509 INFO L225 Difference]: With dead ends: 216 [2024-11-19 06:50:10,509 INFO L226 Difference]: Without dead ends: 208 [2024-11-19 06:50:10,510 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,511 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 51 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 379 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.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:10,511 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 379 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:50:10,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-19 06:50:10,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 198. [2024-11-19 06:50:10,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 109 states have (on average 1.7706422018348624) internal successors, (193), 183 states have internal predecessors, (193), 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,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 209 transitions. [2024-11-19 06:50:10,525 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 209 transitions. Word has length 13 [2024-11-19 06:50:10,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:10,525 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 209 transitions. [2024-11-19 06:50:10,525 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,525 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 209 transitions. [2024-11-19 06:50:10,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-19 06:50:10,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:10,526 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,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 06:50:10,726 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,726 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,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:10,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1483331329, now seen corresponding path program 1 times [2024-11-19 06:50:10,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:10,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540571018] [2024-11-19 06:50:10,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:10,728 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,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:10,729 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,729 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,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:10,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-19 06:50:10,795 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:10,879 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:10,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:50:10,907 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:10,951 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,951 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:10,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:10,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540571018] [2024-11-19 06:50:10,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540571018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:10,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:10,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:50:10,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455142232] [2024-11-19 06:50:10,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:10,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:50:10,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:10,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:50:10,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-11-19 06:50:10,953 INFO L87 Difference]: Start difference. First operand 198 states and 209 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:11,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:11,591 INFO L93 Difference]: Finished difference Result 248 states and 262 transitions. [2024-11-19 06:50:11,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:50:11,592 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:11,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:11,593 INFO L225 Difference]: With dead ends: 248 [2024-11-19 06:50:11,593 INFO L226 Difference]: Without dead ends: 248 [2024-11-19 06:50:11,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=76, Unknown=1, NotChecked=18, Total=132 [2024-11-19 06:50:11,594 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 300 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:11,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 250 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 468 Invalid, 0 Unknown, 260 Unchecked, 0.6s Time] [2024-11-19 06:50:11,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-19 06:50:11,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 207. [2024-11-19 06:50:11,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 118 states have (on average 1.7457627118644068) internal successors, (206), 191 states have internal predecessors, (206), 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:11,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 224 transitions. [2024-11-19 06:50:11,601 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 224 transitions. Word has length 16 [2024-11-19 06:50:11,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:11,601 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 224 transitions. [2024-11-19 06:50:11,602 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:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 224 transitions. [2024-11-19 06:50:11,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 06:50:11,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:11,602 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:11,606 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-19 06:50:11,802 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:11,803 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:11,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:11,803 INFO L85 PathProgramCache]: Analyzing trace with hash -573508604, now seen corresponding path program 1 times [2024-11-19 06:50:11,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:11,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [912378100] [2024-11-19 06:50:11,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:11,804 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:11,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:11,805 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:11,806 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:11,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:11,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:50:11,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:11,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 06:50:11,913 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,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:11,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:11,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [912378100] [2024-11-19 06:50:11,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [912378100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:11,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:11,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:50:11,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267491303] [2024-11-19 06:50:11,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:11,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:50:11,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:11,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:50:11,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:50:11,914 INFO L87 Difference]: Start difference. First operand 207 states and 224 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:12,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:12,315 INFO L93 Difference]: Finished difference Result 262 states and 287 transitions. [2024-11-19 06:50:12,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:50:12,315 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:12,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:12,316 INFO L225 Difference]: With dead ends: 262 [2024-11-19 06:50:12,316 INFO L226 Difference]: Without dead ends: 262 [2024-11-19 06:50:12,316 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:12,317 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 65 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 636 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.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:12,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 636 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:50:12,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-19 06:50:12,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 235. [2024-11-19 06:50:12,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 148 states have (on average 1.7635135135135136) internal successors, (261), 219 states have internal predecessors, (261), 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,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 279 transitions. [2024-11-19 06:50:12,322 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 279 transitions. Word has length 25 [2024-11-19 06:50:12,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:12,322 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 279 transitions. [2024-11-19 06:50:12,322 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:12,322 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 279 transitions. [2024-11-19 06:50:12,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-19 06:50:12,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:12,323 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,326 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:12,523 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:12,524 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:12,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:12,524 INFO L85 PathProgramCache]: Analyzing trace with hash -573508603, now seen corresponding path program 1 times [2024-11-19 06:50:12,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:12,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1168716432] [2024-11-19 06:50:12,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:12,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:12,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:12,525 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:50:12,526 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:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:12,610 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:50:12,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:12,618 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:12,664 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,664 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:12,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:12,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1168716432] [2024-11-19 06:50:12,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1168716432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:12,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:12,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:50:12,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133910752] [2024-11-19 06:50:12,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:12,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:50:12,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:12,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:50:12,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:50:12,665 INFO L87 Difference]: Start difference. First operand 235 states and 279 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,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:13,115 INFO L93 Difference]: Finished difference Result 260 states and 285 transitions. [2024-11-19 06:50:13,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:50:13,115 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,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:13,117 INFO L225 Difference]: With dead ends: 260 [2024-11-19 06:50:13,117 INFO L226 Difference]: Without dead ends: 260 [2024-11-19 06:50:13,117 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,117 INFO L432 NwaCegarLoop]: 170 mSDtfsCounter, 62 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 671 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.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:13,118 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 671 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:50:13,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-19 06:50:13,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 236. [2024-11-19 06:50:13,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 150 states have (on average 1.7466666666666666) internal successors, (262), 219 states have internal predecessors, (262), 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:13,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 283 transitions. [2024-11-19 06:50:13,124 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 283 transitions. Word has length 25 [2024-11-19 06:50:13,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:13,125 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 283 transitions. [2024-11-19 06:50:13,125 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,125 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 283 transitions. [2024-11-19 06:50:13,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-19 06:50:13,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:13,127 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:50:13,135 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:13,327 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:13,328 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:13,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:13,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1385886521, now seen corresponding path program 1 times [2024-11-19 06:50:13,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:13,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626085605] [2024-11-19 06:50:13,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:13,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:50:13,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:13,331 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:13,331 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:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:13,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 06:50:13,409 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:13,432 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,433 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:13,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:13,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626085605] [2024-11-19 06:50:13,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626085605] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:13,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:13,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:50:13,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973434783] [2024-11-19 06:50:13,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:13,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:50:13,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:13,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:50:13,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:50:13,434 INFO L87 Difference]: Start difference. First operand 236 states and 283 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:13,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:13,487 INFO L93 Difference]: Finished difference Result 236 states and 282 transitions. [2024-11-19 06:50:13,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:50:13,488 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:13,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:13,488 INFO L225 Difference]: With dead ends: 236 [2024-11-19 06:50:13,488 INFO L226 Difference]: Without dead ends: 236 [2024-11-19 06:50:13,489 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:13,489 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 81 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 855 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.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:13,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 855 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:50:13,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-19 06:50:13,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2024-11-19 06:50:13,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 150 states have (on average 1.74) internal successors, (261), 219 states have internal predecessors, (261), 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:13,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 282 transitions. [2024-11-19 06:50:13,494 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 282 transitions. Word has length 27 [2024-11-19 06:50:13,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:13,494 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 282 transitions. [2024-11-19 06:50:13,494 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:13,494 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 282 transitions. [2024-11-19 06:50:13,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 06:50:13,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:13,495 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:13,498 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:13,698 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:13,699 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:13,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:13,699 INFO L85 PathProgramCache]: Analyzing trace with hash -69122448, now seen corresponding path program 1 times [2024-11-19 06:50:13,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:13,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658547813] [2024-11-19 06:50:13,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:13,700 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,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:13,702 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:13,703 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:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:13,813 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 06:50:13,814 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:13,818 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:13,864 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 06:50:13,864 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:13,922 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,922 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:13,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:13,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658547813] [2024-11-19 06:50:13,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658547813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:13,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:13,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:50:13,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112192634] [2024-11-19 06:50:13,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:13,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:50:13,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:13,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:50:13,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:50:13,923 INFO L87 Difference]: Start difference. First operand 236 states and 282 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:14,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:14,453 INFO L93 Difference]: Finished difference Result 247 states and 289 transitions. [2024-11-19 06:50:14,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:50:14,453 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:14,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:14,454 INFO L225 Difference]: With dead ends: 247 [2024-11-19 06:50:14,454 INFO L226 Difference]: Without dead ends: 247 [2024-11-19 06:50:14,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:50:14,455 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 132 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 555 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.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:14,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 555 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:50:14,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-19 06:50:14,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 231. [2024-11-19 06:50:14,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 150 states have (on average 1.6733333333333333) internal successors, (251), 214 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:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 272 transitions. [2024-11-19 06:50:14,459 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 272 transitions. Word has length 33 [2024-11-19 06:50:14,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:14,459 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 272 transitions. [2024-11-19 06:50:14,459 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:14,459 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 272 transitions. [2024-11-19 06:50:14,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-19 06:50:14,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:14,460 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,464 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:14,663 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:14,664 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:14,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:14,665 INFO L85 PathProgramCache]: Analyzing trace with hash -69122447, now seen corresponding path program 1 times [2024-11-19 06:50:14,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:14,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565864179] [2024-11-19 06:50:14,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:14,665 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,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:14,667 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:14,668 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:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:14,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 06:50:14,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:14,795 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:14,799 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,827 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:14,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:50:14,871 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:14,879 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:50:14,879 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:14,946 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,946 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:14,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:14,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565864179] [2024-11-19 06:50:14,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1565864179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:14,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:14,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:50:14,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744079170] [2024-11-19 06:50:14,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:14,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:50:14,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:14,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:50:14,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2024-11-19 06:50:14,948 INFO L87 Difference]: Start difference. First operand 231 states and 272 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:15,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:15,510 INFO L93 Difference]: Finished difference Result 281 states and 307 transitions. [2024-11-19 06:50:15,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:50:15,510 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:15,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:15,511 INFO L225 Difference]: With dead ends: 281 [2024-11-19 06:50:15,511 INFO L226 Difference]: Without dead ends: 281 [2024-11-19 06:50:15,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=37, Unknown=1, NotChecked=12, Total=72 [2024-11-19 06:50:15,512 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 134 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 313 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:15,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 433 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 523 Invalid, 0 Unknown, 313 Unchecked, 0.5s Time] [2024-11-19 06:50:15,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-19 06:50:15,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 231. [2024-11-19 06:50:15,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 150 states have (on average 1.64) internal successors, (246), 214 states have internal predecessors, (246), 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,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 267 transitions. [2024-11-19 06:50:15,517 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 267 transitions. Word has length 33 [2024-11-19 06:50:15,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:15,517 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 267 transitions. [2024-11-19 06:50:15,517 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:15,517 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 267 transitions. [2024-11-19 06:50:15,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 06:50:15,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:15,518 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:15,526 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:15,718 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:15,718 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:15,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:15,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1938732971, now seen corresponding path program 1 times [2024-11-19 06:50:15,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:15,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424516780] [2024-11-19 06:50:15,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:15,719 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,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:15,720 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:15,721 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:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:15,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 06:50:15,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:16,073 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,073 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:16,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:16,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424516780] [2024-11-19 06:50:16,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424516780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:16,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:16,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:50:16,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630502119] [2024-11-19 06:50:16,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:16,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:50:16,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:16,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:50:16,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:50:16,077 INFO L87 Difference]: Start difference. First operand 231 states and 267 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:16,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:16,407 INFO L93 Difference]: Finished difference Result 229 states and 264 transitions. [2024-11-19 06:50:16,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:50:16,407 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:16,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:16,408 INFO L225 Difference]: With dead ends: 229 [2024-11-19 06:50:16,408 INFO L226 Difference]: Without dead ends: 229 [2024-11-19 06:50:16,408 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:16,409 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 240 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:16,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 726 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:50:16,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2024-11-19 06:50:16,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2024-11-19 06:50:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 150 states have (on average 1.62) internal successors, (243), 212 states have internal predecessors, (243), 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:16,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 264 transitions. [2024-11-19 06:50:16,414 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 264 transitions. Word has length 36 [2024-11-19 06:50:16,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:16,415 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 264 transitions. [2024-11-19 06:50:16,415 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:16,416 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 264 transitions. [2024-11-19 06:50:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-19 06:50:16,416 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:16,416 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:16,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-19 06:50:16,619 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:16,620 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:16,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:16,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1938732999, now seen corresponding path program 1 times [2024-11-19 06:50:16,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:16,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1502331085] [2024-11-19 06:50:16,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:16,621 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:16,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:16,623 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:16,624 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:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:16,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:50:16,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:16,745 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,745 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:16,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:16,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1502331085] [2024-11-19 06:50:16,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1502331085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:16,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:16,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:50:16,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362229447] [2024-11-19 06:50:16,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:16,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:50:16,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:16,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:50:16,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:50:16,747 INFO L87 Difference]: Start difference. First operand 229 states and 264 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:16,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:16,757 INFO L93 Difference]: Finished difference Result 233 states and 268 transitions. [2024-11-19 06:50:16,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:50:16,757 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:16,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:16,758 INFO L225 Difference]: With dead ends: 233 [2024-11-19 06:50:16,758 INFO L226 Difference]: Without dead ends: 233 [2024-11-19 06:50:16,758 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:16,759 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:16,759 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:16,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2024-11-19 06:50:16,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2024-11-19 06:50:16,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 154 states have (on average 1.603896103896104) internal successors, (247), 216 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:16,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 268 transitions. [2024-11-19 06:50:16,763 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 268 transitions. Word has length 36 [2024-11-19 06:50:16,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:16,764 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 268 transitions. [2024-11-19 06:50:16,764 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:16,764 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 268 transitions. [2024-11-19 06:50:16,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-19 06:50:16,764 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:16,764 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:16,768 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:16,968 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:16,968 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:16,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:16,969 INFO L85 PathProgramCache]: Analyzing trace with hash -407910745, now seen corresponding path program 1 times [2024-11-19 06:50:16,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:16,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139536117] [2024-11-19 06:50:16,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:16,969 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:16,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:16,970 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:16,971 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:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:17,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:50:17,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:17,080 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,081 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:17,081 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:17,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139536117] [2024-11-19 06:50:17,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2139536117] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:17,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:17,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:50:17,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980070465] [2024-11-19 06:50:17,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:17,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:50:17,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:17,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:50:17,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:50:17,082 INFO L87 Difference]: Start difference. First operand 233 states and 268 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:17,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:17,095 INFO L93 Difference]: Finished difference Result 235 states and 270 transitions. [2024-11-19 06:50:17,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:50:17,095 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:17,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:17,096 INFO L225 Difference]: With dead ends: 235 [2024-11-19 06:50:17,096 INFO L226 Difference]: Without dead ends: 235 [2024-11-19 06:50:17,096 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:17,097 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 0 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 572 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:17,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 572 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:17,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-19 06:50:17,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2024-11-19 06:50:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 156 states have (on average 1.5961538461538463) internal successors, (249), 218 states have internal predecessors, (249), 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,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 270 transitions. [2024-11-19 06:50:17,101 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 270 transitions. Word has length 40 [2024-11-19 06:50:17,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:17,101 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 270 transitions. [2024-11-19 06:50:17,102 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:17,102 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 270 transitions. [2024-11-19 06:50:17,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 06:50:17,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:17,102 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:17,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-19 06:50:17,305 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:17,306 INFO L396 AbstractCegarLoop]: === Iteration 16 === 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:17,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:17,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1160127762, now seen corresponding path program 1 times [2024-11-19 06:50:17,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:17,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066558103] [2024-11-19 06:50:17,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:17,307 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,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:17,308 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:17,308 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:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:17,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-19 06:50:17,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:17,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 06:50:17,548 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-19 06:50:17,549 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 16 treesize of output 17 [2024-11-19 06:50:17,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-19 06:50:17,734 INFO L349 Elim1Store]: treesize reduction 14, result has 61.1 percent of original size [2024-11-19 06:50:17,734 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 25 treesize of output 34 [2024-11-19 06:50:18,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:50:18,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-11-19 06:50:18,043 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-19 06:50:18,079 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,080 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:18,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:18,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066558103] [2024-11-19 06:50:18,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1066558103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:18,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:18,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 06:50:18,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77226975] [2024-11-19 06:50:18,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:18,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 06:50:18,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:18,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 06:50:18,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-11-19 06:50:18,082 INFO L87 Difference]: Start difference. First operand 235 states and 270 transitions. Second operand has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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:19,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:19,498 INFO L93 Difference]: Finished difference Result 330 states and 364 transitions. [2024-11-19 06:50:19,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 06:50:19,498 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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 42 [2024-11-19 06:50:19,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:19,499 INFO L225 Difference]: With dead ends: 330 [2024-11-19 06:50:19,500 INFO L226 Difference]: Without dead ends: 330 [2024-11-19 06:50:19,500 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2024-11-19 06:50:19,500 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 717 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 1182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:19,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 789 Invalid, 1182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-19 06:50:19,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-19 06:50:19,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 255. [2024-11-19 06:50:19,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 174 states have (on average 1.5977011494252873) internal successors, (278), 234 states have internal predecessors, (278), 10 states have call successors, (10), 8 states have call predecessors, (10), 9 states have return successors, (14), 12 states have call predecessors, (14), 10 states have call successors, (14) [2024-11-19 06:50:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 302 transitions. [2024-11-19 06:50:19,505 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 302 transitions. Word has length 42 [2024-11-19 06:50:19,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:19,505 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 302 transitions. [2024-11-19 06:50:19,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 3.272727272727273) internal successors, (36), 10 states have internal predecessors, (36), 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:19,505 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 302 transitions. [2024-11-19 06:50:19,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-19 06:50:19,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:19,506 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,511 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:19,709 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:19,710 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:19,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1160127761, now seen corresponding path program 1 times [2024-11-19 06:50:19,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:19,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [910736576] [2024-11-19 06:50:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:19,711 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,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:19,712 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:19,713 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:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:19,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 06:50:19,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:19,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:50:19,988 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,998 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 06:50:19,999 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,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:50:20,165 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,264 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 06:50:20,264 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,414 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,414 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:20,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:20,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [910736576] [2024-11-19 06:50:20,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [910736576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:20,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:20,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:50:20,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234406512] [2024-11-19 06:50:20,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:20,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:50:20,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:20,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:50:20,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-19 06:50:20,415 INFO L87 Difference]: Start difference. First operand 255 states and 302 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:22,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:22,089 INFO L93 Difference]: Finished difference Result 281 states and 324 transitions. [2024-11-19 06:50:22,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:50:22,089 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:22,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:22,090 INFO L225 Difference]: With dead ends: 281 [2024-11-19 06:50:22,090 INFO L226 Difference]: Without dead ends: 281 [2024-11-19 06:50:22,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:50:22,091 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 496 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:50:22,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 428 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 06:50:22,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-19 06:50:22,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 244. [2024-11-19 06:50:22,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 167 states have (on average 1.5688622754491017) internal successors, (262), 224 states have internal predecessors, (262), 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:22,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 283 transitions. [2024-11-19 06:50:22,096 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 283 transitions. Word has length 42 [2024-11-19 06:50:22,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:22,096 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 283 transitions. [2024-11-19 06:50:22,096 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:22,096 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 283 transitions. [2024-11-19 06:50:22,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 06:50:22,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:22,097 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:22,103 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2024-11-19 06:50:22,297 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:22,298 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:22,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:22,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1604202142, now seen corresponding path program 1 times [2024-11-19 06:50:22,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:22,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831505493] [2024-11-19 06:50:22,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:22,298 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:22,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:22,301 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:22,302 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:22,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:22,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:50:22,413 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:22,422 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:22,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:22,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:22,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831505493] [2024-11-19 06:50:22,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831505493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:22,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:22,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:50:22,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327834912] [2024-11-19 06:50:22,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:22,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:50:22,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:22,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:50:22,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:50:22,424 INFO L87 Difference]: Start difference. First operand 244 states and 283 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:22,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:50:22,439 INFO L93 Difference]: Finished difference Result 246 states and 284 transitions. [2024-11-19 06:50:22,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:50:22,440 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:22,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:50:22,441 INFO L225 Difference]: With dead ends: 246 [2024-11-19 06:50:22,441 INFO L226 Difference]: Without dead ends: 246 [2024-11-19 06:50:22,441 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:22,442 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 0 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 567 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:22,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 567 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:22,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2024-11-19 06:50:22,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2024-11-19 06:50:22,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 169 states have (on average 1.5562130177514792) internal successors, (263), 226 states have internal predecessors, (263), 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:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 284 transitions. [2024-11-19 06:50:22,447 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 284 transitions. Word has length 43 [2024-11-19 06:50:22,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:50:22,447 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 284 transitions. [2024-11-19 06:50:22,447 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:22,447 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 284 transitions. [2024-11-19 06:50:22,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-19 06:50:22,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:50:22,448 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:22,452 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:22,648 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:22,648 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:22,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:50:22,649 INFO L85 PathProgramCache]: Analyzing trace with hash 358651335, now seen corresponding path program 1 times [2024-11-19 06:50:22,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:50:22,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1449151603] [2024-11-19 06:50:22,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:50:22,649 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:22,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:50:22,650 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:22,652 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:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:50:22,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 06:50:22,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:50:22,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:50:22,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:50:22,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:50:22,869 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:50:22,870 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:50:22,871 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:22,926 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:24,288 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:27,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:50:27,300 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:30,035 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:50:30,035 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:30,051 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:30,051 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:50:30,051 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:50:30,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1449151603] [2024-11-19 06:50:30,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1449151603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:50:30,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:50:30,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:50:30,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415758359] [2024-11-19 06:50:30,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:50:30,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:50:30,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:50:30,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:50:30,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=31, Unknown=5, NotChecked=0, Total=56 [2024-11-19 06:50:30,052 INFO L87 Difference]: Start difference. First operand 246 states and 284 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:33,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.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:37,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:50:41,844 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:42,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:50:44,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:50:45,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:50:49,876 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:53,882 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:55,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s 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,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:51:01,269 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,275 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:09,279 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:10,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s 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,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s 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,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:12,807 INFO L93 Difference]: Finished difference Result 253 states and 291 transitions. [2024-11-19 06:51:12,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:51:12,808 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:12,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:12,809 INFO L225 Difference]: With dead ends: 253 [2024-11-19 06:51:12,809 INFO L226 Difference]: Without dead ends: 253 [2024-11-19 06:51:12,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=24, Invalid=43, Unknown=5, NotChecked=0, Total=72 [2024-11-19 06:51:12,809 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 63 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:12,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 661 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 15 Unknown, 0 Unchecked, 42.7s Time] [2024-11-19 06:51:12,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2024-11-19 06:51:12,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 245. [2024-11-19 06:51:12,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 169 states have (on average 1.544378698224852) internal successors, (261), 225 states have internal predecessors, (261), 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:12,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 282 transitions. [2024-11-19 06:51:12,815 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 282 transitions. Word has length 44 [2024-11-19 06:51:12,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:12,816 INFO L471 AbstractCegarLoop]: Abstraction has 245 states and 282 transitions. [2024-11-19 06:51:12,816 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:12,816 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 282 transitions. [2024-11-19 06:51:12,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 06:51:12,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:12,817 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:12,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2024-11-19 06:51:13,017 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:13,017 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:13,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:13,018 INFO L85 PathProgramCache]: Analyzing trace with hash 235921110, now seen corresponding path program 1 times [2024-11-19 06:51:13,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:51:13,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1898746332] [2024-11-19 06:51:13,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:13,018 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:13,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:51:13,020 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:13,021 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:13,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:13,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-19 06:51:13,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:51:13,209 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:13,316 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:13,380 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-11-19 06:51:13,381 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:13,421 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-19 06:51:13,421 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:13,590 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2024-11-19 06:51:13,590 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 [2024-11-19 06:51:13,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 44 treesize of output 33 [2024-11-19 06:51:13,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 44 treesize of output 33 [2024-11-19 06:51:14,285 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-11-19 06:51:14,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 29 [2024-11-19 06:51:14,341 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-19 06:51:14,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 06:51:14,448 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:51:14,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:51:14,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:51:14,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1898746332] [2024-11-19 06:51:14,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1898746332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:14,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:14,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-19 06:51:14,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613940193] [2024-11-19 06:51:14,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:14,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 06:51:14,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:51:14,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 06:51:14,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-11-19 06:51:14,450 INFO L87 Difference]: Start difference. First operand 245 states and 282 transitions. Second operand has 19 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:51:18,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:51:18,112 INFO L93 Difference]: Finished difference Result 386 states and 434 transitions. [2024-11-19 06:51:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 06:51:18,112 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2024-11-19 06:51:18,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:51:18,114 INFO L225 Difference]: With dead ends: 386 [2024-11-19 06:51:18,114 INFO L226 Difference]: Without dead ends: 386 [2024-11-19 06:51:18,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2024-11-19 06:51:18,115 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 645 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 1812 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 1490 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:51:18,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 1490 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1812 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-19 06:51:18,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2024-11-19 06:51:18,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 308. [2024-11-19 06:51:18,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 226 states have (on average 1.5530973451327434) internal successors, (351), 284 states have internal predecessors, (351), 12 states have call successors, (12), 10 states have call predecessors, (12), 11 states have return successors, (17), 13 states have call predecessors, (17), 12 states have call successors, (17) [2024-11-19 06:51:18,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 380 transitions. [2024-11-19 06:51:18,125 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 380 transitions. Word has length 45 [2024-11-19 06:51:18,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:51:18,125 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 380 transitions. [2024-11-19 06:51:18,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:51:18,125 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 380 transitions. [2024-11-19 06:51:18,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-19 06:51:18,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:51:18,126 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:18,132 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 (21)] Forceful destruction successful, exit code 0 [2024-11-19 06:51:18,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:51:18,326 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 76 more)] === [2024-11-19 06:51:18,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:51:18,327 INFO L85 PathProgramCache]: Analyzing trace with hash 235921111, now seen corresponding path program 1 times [2024-11-19 06:51:18,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:51:18,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1113208237] [2024-11-19 06:51:18,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:51:18,327 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:18,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:51:18,328 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:51:18,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2024-11-19 06:51:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:51:18,475 INFO L255 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-19 06:51:18,478 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:51:18,540 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:51:18,596 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-19 06:51:18,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-19 06:51:18,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:51:18,847 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 11 treesize of output 7 [2024-11-19 06:51:18,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:51:18,885 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 18 treesize of output 13 [2024-11-19 06:51:18,913 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2024-11-19 06:51:18,914 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 4 case distinctions, treesize of input 32 treesize of output 44 [2024-11-19 06:51:18,977 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 19 treesize of output 11 [2024-11-19 06:51:18,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 9 treesize of output 3 [2024-11-19 06:51:19,229 INFO L349 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2024-11-19 06:51:19,230 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 1 case distinctions, treesize of input 16 treesize of output 26 [2024-11-19 06:51:19,267 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-19 06:51:19,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2024-11-19 06:51:19,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 25 [2024-11-19 06:51:19,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 19 treesize of output 18 [2024-11-19 06:51:19,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 25 [2024-11-19 06:51:19,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 11 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 21 [2024-11-19 06:51:20,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-19 06:51:20,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 7 [2024-11-19 06:51:20,631 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:51:20,631 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:51:20,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:51:20,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1113208237] [2024-11-19 06:51:20,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1113208237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:51:20,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:51:20,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-19 06:51:20,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909821421] [2024-11-19 06:51:20,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:51:20,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 06:51:20,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:51:20,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 06:51:20,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:51:20,633 INFO L87 Difference]: Start difference. First operand 308 states and 380 transitions. Second operand has 23 states, 19 states have (on average 2.0) internal successors, (38), 17 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:51:26,414 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:29,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 06:51:40,107 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:43,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]