./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d 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/uthash-2.0.2/uthash_OAT_nondet_test3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 02:53:08,359 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 02:53:08,418 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 02:53:08,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 02:53:08,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 02:53:08,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 02:53:08,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 02:53:08,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 02:53:08,447 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 02:53:08,451 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 02:53:08,451 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 02:53:08,451 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 02:53:08,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 02:53:08,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 02:53:08,452 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 02:53:08,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 02:53:08,452 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 02:53:08,453 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 02:53:08,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 02:53:08,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 02:53:08,455 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 02:53:08,456 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 02:53:08,456 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 02:53:08,456 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 02:53:08,457 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 02:53:08,457 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 02:53:08,457 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 02:53:08,457 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 02:53:08,457 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 02:53:08,458 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 02:53:08,458 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 02:53:08,458 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 02:53:08,458 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 02:53:08,459 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:53:08,459 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 02:53:08,459 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 02:53:08,460 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 02:53:08,460 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 02:53:08,460 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 02:53:08,461 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 02:53:08,461 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 02:53:08,461 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 02:53:08,462 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2024-11-17 02:53:08,674 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 02:53:08,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 02:53:08,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 02:53:08,703 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 02:53:08,703 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 02:53:08,705 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i [2024-11-17 02:53:10,286 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 02:53:10,554 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 02:53:10,556 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i [2024-11-17 02:53:10,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7ccfb67a/9d73945d383742bf935d996d9e31bd0a/FLAG53175f622 [2024-11-17 02:53:10,845 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d7ccfb67a/9d73945d383742bf935d996d9e31bd0a [2024-11-17 02:53:10,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 02:53:10,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 02:53:10,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 02:53:10,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 02:53:10,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 02:53:10,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:53:10" (1/1) ... [2024-11-17 02:53:10,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c973e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:53:10, skipping insertion in model container [2024-11-17 02:53:10,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:53:10" (1/1) ... [2024-11-17 02:53:10,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:53:11,320 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:11,354 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:11,358 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:11,363 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:11,377 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:11,400 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:11,400 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:11,402 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:11,402 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:11,405 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:11,406 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:11,407 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:11,407 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:11,413 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:11,413 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:11,414 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:11,418 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:11,419 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:11,420 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:11,423 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:11,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:53:11,450 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-17 02:53:11,451 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@a426cb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:53:11, skipping insertion in model container [2024-11-17 02:53:11,451 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 02:53:11,451 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-17 02:53:11,457 INFO L158 Benchmark]: Toolchain (without parser) took 603.79ms. Allocated memory is still 144.7MB. Free memory was 72.6MB in the beginning and 97.4MB in the end (delta: -24.8MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2024-11-17 02:53:11,461 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 144.7MB. Free memory is still 98.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-17 02:53:11,462 INFO L158 Benchmark]: CACSL2BoogieTranslator took 601.95ms. Allocated memory is still 144.7MB. Free memory was 72.4MB in the beginning and 97.9MB in the end (delta: -25.5MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. [2024-11-17 02:53:11,463 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 144.7MB. Free memory is still 98.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 601.95ms. Allocated memory is still 144.7MB. Free memory was 72.4MB in the beginning and 97.9MB in the end (delta: -25.5MB). Peak memory consumption was 8.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 750]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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/uthash-2.0.2/uthash_OAT_nondet_test3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 02:53:13,353 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 02:53:13,418 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-17 02:53:13,421 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 02:53:13,422 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 02:53:13,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 02:53:13,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 02:53:13,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 02:53:13,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 02:53:13,449 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 02:53:13,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 02:53:13,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 02:53:13,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 02:53:13,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 02:53:13,453 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 02:53:13,453 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 02:53:13,453 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 02:53:13,453 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 02:53:13,453 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 02:53:13,453 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 02:53:13,454 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 02:53:13,455 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 02:53:13,455 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 02:53:13,455 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 02:53:13,455 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 02:53:13,455 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-17 02:53:13,456 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 02:53:13,456 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-17 02:53:13,456 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 02:53:13,456 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 02:53:13,456 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 02:53:13,456 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 02:53:13,457 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 02:53:13,457 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 02:53:13,457 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 02:53:13,457 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:53:13,457 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 02:53:13,457 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 02:53:13,457 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-17 02:53:13,457 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-17 02:53:13,458 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 02:53:13,459 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 02:53:13,459 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 02:53:13,459 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 02:53:13,459 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> be29e8161f6a6b8e8b181f151bf5388e6a9e3237ae426f572d4ceda403cee9b8 [2024-11-17 02:53:13,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 02:53:13,790 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 02:53:13,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 02:53:13,794 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 02:53:13,795 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 02:53:13,796 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i [2024-11-17 02:53:15,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 02:53:15,619 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 02:53:15,620 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_nondet_test3-2.i [2024-11-17 02:53:15,635 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fbb2e7f4/c491fa08335045a18a571bb141fad24c/FLAG47fadb8e8 [2024-11-17 02:53:15,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fbb2e7f4/c491fa08335045a18a571bb141fad24c [2024-11-17 02:53:15,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 02:53:15,652 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 02:53:15,653 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 02:53:15,653 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 02:53:15,657 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 02:53:15,658 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:53:15" (1/1) ... [2024-11-17 02:53:15,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff0ab47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:53:15, skipping insertion in model container [2024-11-17 02:53:15,659 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:53:15" (1/1) ... [2024-11-17 02:53:15,703 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:53:16,102 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,136 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,147 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,152 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,162 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,206 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,207 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,211 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,212 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,217 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,218 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,219 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,222 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,226 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,230 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,232 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,232 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,233 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,234 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,236 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,241 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:53:16,251 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-17 02:53:16,268 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:53:16,293 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,310 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,315 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,321 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,325 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,343 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,343 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,344 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,345 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,346 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,347 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,347 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,348 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,350 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,350 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,351 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,352 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,352 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,353 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,354 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-17 02:53:16,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:53:16,360 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 02:53:16,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:53:16,476 INFO L204 MainTranslator]: Completed translation [2024-11-17 02:53:16,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:53:16 WrapperNode [2024-11-17 02:53:16,477 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 02:53:16,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 02:53:16,478 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 02:53:16,478 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 02:53:16,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:53:16" (1/1) ... [2024-11-17 02:53:16,509 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:53:16" (1/1) ... [2024-11-17 02:53:16,571 INFO L138 Inliner]: procedures = 180, calls = 325, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1177 [2024-11-17 02:53:16,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 02:53:16,573 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 02:53:16,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 02:53:16,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 02:53:16,588 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:53:16" (1/1) ... [2024-11-17 02:53:16,588 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:53:16" (1/1) ... [2024-11-17 02:53:16,601 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:53:16" (1/1) ... [2024-11-17 02:53:16,687 INFO L175 MemorySlicer]: Split 302 memory accesses to 3 slices as follows [2, 34, 266]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 62 writes are split as follows [0, 4, 58]. [2024-11-17 02:53:16,687 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:53:16" (1/1) ... [2024-11-17 02:53:16,687 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:53:16" (1/1) ... [2024-11-17 02:53:16,736 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:53:16" (1/1) ... [2024-11-17 02:53:16,740 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:53:16" (1/1) ... [2024-11-17 02:53:16,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:53:16" (1/1) ... [2024-11-17 02:53:16,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:53:16" (1/1) ... [2024-11-17 02:53:16,762 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 02:53:16,763 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 02:53:16,763 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 02:53:16,763 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 02:53:16,763 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:53:16" (1/1) ... [2024-11-17 02:53:16,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:53:16,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:53:16,796 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-17 02:53:16,804 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-17 02:53:16,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-17 02:53:16,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-17 02:53:16,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-17 02:53:16,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-17 02:53:16,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-17 02:53:16,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-17 02:53:16,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-17 02:53:16,841 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-17 02:53:16,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 02:53:16,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 02:53:16,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-17 02:53:16,841 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 02:53:16,841 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 02:53:16,841 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-17 02:53:16,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 02:53:16,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 02:53:16,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 02:53:16,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 02:53:16,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 02:53:16,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 02:53:16,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 02:53:16,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 02:53:16,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 02:53:16,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-17 02:53:16,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-17 02:53:16,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-17 02:53:16,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 02:53:16,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-17 02:53:16,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-17 02:53:16,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-17 02:53:16,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 02:53:16,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 02:53:17,049 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 02:53:17,051 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 02:53:20,156 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-17 02:53:20,265 INFO L? ?]: Removed 1300 outVars from TransFormulas that were not future-live. [2024-11-17 02:53:20,265 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 02:53:20,308 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 02:53:20,308 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-17 02:53:20,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:53:20 BoogieIcfgContainer [2024-11-17 02:53:20,312 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 02:53:20,314 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 02:53:20,314 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 02:53:20,316 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 02:53:20,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 02:53:15" (1/3) ... [2024-11-17 02:53:20,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a283a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:53:20, skipping insertion in model container [2024-11-17 02:53:20,321 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:53:16" (2/3) ... [2024-11-17 02:53:20,322 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70a283a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:53:20, skipping insertion in model container [2024-11-17 02:53:20,322 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:53:20" (3/3) ... [2024-11-17 02:53:20,323 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_nondet_test3-2.i [2024-11-17 02:53:20,352 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 02:53:20,352 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 630 error locations. [2024-11-17 02:53:20,442 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 02:53:20,449 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;@125eed05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 02:53:20,450 INFO L334 AbstractCegarLoop]: Starting to check reachability of 630 error locations. [2024-11-17 02:53:20,457 INFO L276 IsEmpty]: Start isEmpty. Operand has 1293 states, 658 states have (on average 2.1732522796352582) internal successors, (1430), 1286 states have internal predecessors, (1430), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:53:20,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-17 02:53:20,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:20,468 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-17 02:53:20,469 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr627REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:53:20,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:20,474 INFO L85 PathProgramCache]: Analyzing trace with hash 45220668, now seen corresponding path program 1 times [2024-11-17 02:53:20,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:20,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1962880925] [2024-11-17 02:53:20,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:53:20,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:53:20,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:20,489 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-17 02:53:20,490 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-17 02:53:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:53:20,661 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:53:20,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:53:20,704 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-17 02:53:20,718 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-17 02:53:20,718 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:53:20,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:53:20,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1962880925] [2024-11-17 02:53:20,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1962880925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:53:20,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:53:20,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:53:20,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968215025] [2024-11-17 02:53:20,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:53:20,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:53:20,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:53:20,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:53:20,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:53:20,754 INFO L87 Difference]: Start difference. First operand has 1293 states, 658 states have (on average 2.1732522796352582) internal successors, (1430), 1286 states have internal predecessors, (1430), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:22,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:53:22,432 INFO L93 Difference]: Finished difference Result 1475 states and 1555 transitions. [2024-11-17 02:53:22,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:53:22,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-17 02:53:22,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:53:22,456 INFO L225 Difference]: With dead ends: 1475 [2024-11-17 02:53:22,456 INFO L226 Difference]: Without dead ends: 1472 [2024-11-17 02:53:22,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:53:22,463 INFO L432 NwaCegarLoop]: 785 mSDtfsCounter, 1186 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1191 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:53:22,463 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1191 Valid, 955 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-17 02:53:22,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2024-11-17 02:53:22,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1278. [2024-11-17 02:53:22,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 659 states have (on average 2.031866464339909) internal successors, (1339), 1270 states have internal predecessors, (1339), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:53:22,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1349 transitions. [2024-11-17 02:53:22,543 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1349 transitions. Word has length 4 [2024-11-17 02:53:22,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:53:22,543 INFO L471 AbstractCegarLoop]: Abstraction has 1278 states and 1349 transitions. [2024-11-17 02:53:22,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:22,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1349 transitions. [2024-11-17 02:53:22,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-17 02:53:22,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:22,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-17 02:53:22,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-17 02:53:22,747 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-17 02:53:22,748 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr628REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:53:22,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:22,748 INFO L85 PathProgramCache]: Analyzing trace with hash 45220669, now seen corresponding path program 1 times [2024-11-17 02:53:22,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:22,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842067288] [2024-11-17 02:53:22,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:53:22,749 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-17 02:53:22,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:22,752 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-17 02:53:22,793 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-17 02:53:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:53:22,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:53:22,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:53:22,910 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-17 02:53:22,961 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-17 02:53:22,961 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:53:22,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:53:22,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842067288] [2024-11-17 02:53:22,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1842067288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:53:22,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:53:22,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:53:22,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910406738] [2024-11-17 02:53:22,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:53:22,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:53:22,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:53:22,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:53:22,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:53:22,966 INFO L87 Difference]: Start difference. First operand 1278 states and 1349 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:25,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:53:25,337 INFO L93 Difference]: Finished difference Result 1905 states and 2021 transitions. [2024-11-17 02:53:25,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:53:25,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-17 02:53:25,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:53:25,342 INFO L225 Difference]: With dead ends: 1905 [2024-11-17 02:53:25,342 INFO L226 Difference]: Without dead ends: 1905 [2024-11-17 02:53:25,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:53:25,343 INFO L432 NwaCegarLoop]: 1051 mSDtfsCounter, 666 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-17 02:53:25,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 1774 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-17 02:53:25,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1905 states. [2024-11-17 02:53:25,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1905 to 1502. [2024-11-17 02:53:25,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 883 states have (on average 2.0113250283125708) internal successors, (1776), 1493 states have internal predecessors, (1776), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 02:53:25,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1788 transitions. [2024-11-17 02:53:25,377 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1788 transitions. Word has length 4 [2024-11-17 02:53:25,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:53:25,377 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 1788 transitions. [2024-11-17 02:53:25,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:25,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1788 transitions. [2024-11-17 02:53:25,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-17 02:53:25,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:25,378 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-17 02:53:25,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-17 02:53:25,580 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-17 02:53:25,581 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:53:25,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:25,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1401795899, now seen corresponding path program 1 times [2024-11-17 02:53:25,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:25,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008479510] [2024-11-17 02:53:25,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:53:25,585 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-17 02:53:25,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:25,589 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-17 02:53:25,589 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-17 02:53:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:53:25,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 02:53:25,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:53:25,734 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_48| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_48|)) (= |c_#valid| (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_48| (_ bv0 1))))) is different from true [2024-11-17 02:53:25,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-17 02:53:25,745 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:53:25,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:53:25,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008479510] [2024-11-17 02:53:25,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008479510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:53:25,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:53:25,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:53:25,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959467439] [2024-11-17 02:53:25,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:53:25,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:53:25,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:53:25,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:53:25,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-17 02:53:25,747 INFO L87 Difference]: Start difference. First operand 1502 states and 1788 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:27,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:53:27,841 INFO L93 Difference]: Finished difference Result 2101 states and 2428 transitions. [2024-11-17 02:53:27,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:53:27,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-17 02:53:27,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:53:27,846 INFO L225 Difference]: With dead ends: 2101 [2024-11-17 02:53:27,847 INFO L226 Difference]: Without dead ends: 2099 [2024-11-17 02:53:27,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-17 02:53:27,850 INFO L432 NwaCegarLoop]: 1067 mSDtfsCounter, 636 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 2908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1981 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:53:27,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [638 Valid, 1768 Invalid, 2908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 927 Invalid, 0 Unknown, 1981 Unchecked, 2.0s Time] [2024-11-17 02:53:27,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2099 states. [2024-11-17 02:53:27,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2099 to 1502. [2024-11-17 02:53:27,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1502 states, 883 states have (on average 2.0101925254813136) internal successors, (1775), 1493 states have internal predecessors, (1775), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 02:53:27,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1502 states to 1502 states and 1787 transitions. [2024-11-17 02:53:27,878 INFO L78 Accepts]: Start accepts. Automaton has 1502 states and 1787 transitions. Word has length 5 [2024-11-17 02:53:27,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:53:27,878 INFO L471 AbstractCegarLoop]: Abstraction has 1502 states and 1787 transitions. [2024-11-17 02:53:27,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:27,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1502 states and 1787 transitions. [2024-11-17 02:53:27,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 02:53:27,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:27,879 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:53:27,886 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-17 02:53:28,081 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-17 02:53:28,082 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr624REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:53:28,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:28,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1323606888, now seen corresponding path program 1 times [2024-11-17 02:53:28,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:28,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244622876] [2024-11-17 02:53:28,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:53:28,085 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-17 02:53:28,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:28,089 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-17 02:53:28,090 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-17 02:53:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:53:28,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-17 02:53:28,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:53:28,208 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-17 02:53:28,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-17 02:53:28,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 02:53:28,295 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-17 02:53:28,310 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 02:53:28,310 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-17 02:53:28,333 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-17 02:53:28,334 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:53:28,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:53:28,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244622876] [2024-11-17 02:53:28,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [244622876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:53:28,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:53:28,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:53:28,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107161631] [2024-11-17 02:53:28,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:53:28,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:53:28,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:53:28,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:53:28,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:53:28,335 INFO L87 Difference]: Start difference. First operand 1502 states and 1787 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:30,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:53:30,634 INFO L93 Difference]: Finished difference Result 1691 states and 1986 transitions. [2024-11-17 02:53:30,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:53:30,635 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-17 02:53:30,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:53:30,639 INFO L225 Difference]: With dead ends: 1691 [2024-11-17 02:53:30,639 INFO L226 Difference]: Without dead ends: 1691 [2024-11-17 02:53:30,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:53:30,640 INFO L432 NwaCegarLoop]: 465 mSDtfsCounter, 1495 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 1123 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1500 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 1140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:53:30,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1500 Valid, 578 Invalid, 1140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1123 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-17 02:53:30,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2024-11-17 02:53:30,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 1266. [2024-11-17 02:53:30,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 659 states have (on average 2.009104704097117) internal successors, (1324), 1258 states have internal predecessors, (1324), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:53:30,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1334 transitions. [2024-11-17 02:53:30,664 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1334 transitions. Word has length 9 [2024-11-17 02:53:30,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:53:30,664 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1334 transitions. [2024-11-17 02:53:30,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:30,664 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1334 transitions. [2024-11-17 02:53:30,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 02:53:30,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:30,665 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:53:30,669 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 (5)] Forceful destruction successful, exit code 0 [2024-11-17 02:53:30,865 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-17 02:53:30,866 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr621REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:53:30,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:30,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1917860786, now seen corresponding path program 1 times [2024-11-17 02:53:30,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:30,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [96286074] [2024-11-17 02:53:30,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:53:30,867 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-17 02:53:30,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:30,869 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-17 02:53:30,870 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-17 02:53:30,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:53:30,964 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:53:30,966 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:53:30,970 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-17 02:53:30,977 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-17 02:53:30,978 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:53:30,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:53:30,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [96286074] [2024-11-17 02:53:30,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [96286074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:53:30,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:53:30,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:53:30,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174290262] [2024-11-17 02:53:30,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:53:30,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:53:30,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:53:30,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:53:30,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:53:30,979 INFO L87 Difference]: Start difference. First operand 1266 states and 1334 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:32,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:53:32,539 INFO L93 Difference]: Finished difference Result 1616 states and 1715 transitions. [2024-11-17 02:53:32,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:53:32,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-17 02:53:32,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:53:32,543 INFO L225 Difference]: With dead ends: 1616 [2024-11-17 02:53:32,543 INFO L226 Difference]: Without dead ends: 1616 [2024-11-17 02:53:32,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:53:32,543 INFO L432 NwaCegarLoop]: 1204 mSDtfsCounter, 951 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 874 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 874 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:53:32,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 1572 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 874 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-17 02:53:32,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2024-11-17 02:53:32,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1218. [2024-11-17 02:53:32,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 659 states have (on average 1.9362670713201822) internal successors, (1276), 1210 states have internal predecessors, (1276), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:53:32,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1286 transitions. [2024-11-17 02:53:32,557 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1286 transitions. Word has length 10 [2024-11-17 02:53:32,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:53:32,558 INFO L471 AbstractCegarLoop]: Abstraction has 1218 states and 1286 transitions. [2024-11-17 02:53:32,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:32,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1286 transitions. [2024-11-17 02:53:32,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 02:53:32,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:32,558 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:53:32,561 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-17 02:53:32,761 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-17 02:53:32,762 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr622REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:53:32,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:32,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1917860787, now seen corresponding path program 1 times [2024-11-17 02:53:32,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:32,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [357046485] [2024-11-17 02:53:32,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:53:32,763 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-17 02:53:32,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:32,764 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-17 02:53:32,765 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-17 02:53:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:53:32,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:53:32,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:53:32,873 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-17 02:53:32,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:53:32,891 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:53:32,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:53:32,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [357046485] [2024-11-17 02:53:32,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [357046485] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:53:32,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:53:32,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:53:32,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046632597] [2024-11-17 02:53:32,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:53:32,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:53:32,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:53:32,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:53:32,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:53:32,892 INFO L87 Difference]: Start difference. First operand 1218 states and 1286 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:34,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:53:34,854 INFO L93 Difference]: Finished difference Result 1706 states and 1808 transitions. [2024-11-17 02:53:34,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:53:34,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-17 02:53:34,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:53:34,859 INFO L225 Difference]: With dead ends: 1706 [2024-11-17 02:53:34,859 INFO L226 Difference]: Without dead ends: 1706 [2024-11-17 02:53:34,859 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:53:34,860 INFO L432 NwaCegarLoop]: 1400 mSDtfsCounter, 710 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 830 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1958 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-17 02:53:34,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1958 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 830 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-17 02:53:34,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1706 states. [2024-11-17 02:53:34,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1706 to 1247. [2024-11-17 02:53:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 698 states have (on average 1.9226361031518624) internal successors, (1342), 1239 states have internal predecessors, (1342), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:53:34,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1352 transitions. [2024-11-17 02:53:34,879 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1352 transitions. Word has length 10 [2024-11-17 02:53:34,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:53:34,880 INFO L471 AbstractCegarLoop]: Abstraction has 1247 states and 1352 transitions. [2024-11-17 02:53:34,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:34,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1352 transitions. [2024-11-17 02:53:34,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-17 02:53:34,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:34,883 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:53:34,891 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-17 02:53:35,086 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-17 02:53:35,087 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:53:35,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:35,087 INFO L85 PathProgramCache]: Analyzing trace with hash 2037372047, now seen corresponding path program 1 times [2024-11-17 02:53:35,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:35,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039394032] [2024-11-17 02:53:35,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:53:35,088 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-17 02:53:35,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:35,091 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-17 02:53:35,093 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-17 02:53:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:53:35,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-17 02:53:35,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:53:35,262 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-17 02:53:35,262 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:53:35,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:53:35,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039394032] [2024-11-17 02:53:35,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039394032] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:53:35,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:53:35,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:53:35,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467004998] [2024-11-17 02:53:35,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:53:35,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:53:35,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:53:35,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:53:35,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:53:35,264 INFO L87 Difference]: Start difference. First operand 1247 states and 1352 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:35,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:53:35,807 INFO L93 Difference]: Finished difference Result 1866 states and 2056 transitions. [2024-11-17 02:53:35,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:53:35,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-17 02:53:35,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:53:35,812 INFO L225 Difference]: With dead ends: 1866 [2024-11-17 02:53:35,812 INFO L226 Difference]: Without dead ends: 1866 [2024-11-17 02:53:35,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:53:35,813 INFO L432 NwaCegarLoop]: 1408 mSDtfsCounter, 652 mSDsluCounter, 2444 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 653 SdHoareTripleChecker+Valid, 3852 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:53:35,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [653 Valid, 3852 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 374 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 02:53:35,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1866 states. [2024-11-17 02:53:35,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1866 to 1508. [2024-11-17 02:53:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 958 states have (on average 1.8966597077244258) internal successors, (1817), 1499 states have internal predecessors, (1817), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 02:53:35,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1829 transitions. [2024-11-17 02:53:35,830 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 1829 transitions. Word has length 15 [2024-11-17 02:53:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:53:35,830 INFO L471 AbstractCegarLoop]: Abstraction has 1508 states and 1829 transitions. [2024-11-17 02:53:35,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:35,831 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1829 transitions. [2024-11-17 02:53:35,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 02:53:35,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:35,831 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:53:35,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-17 02:53:36,033 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-17 02:53:36,034 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr297REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:53:36,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:36,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1138753934, now seen corresponding path program 1 times [2024-11-17 02:53:36,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:36,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1149766717] [2024-11-17 02:53:36,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:53:36,035 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-17 02:53:36,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:36,036 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-17 02:53:36,037 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-17 02:53:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:53:36,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 02:53:36,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:53:36,149 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-17 02:53:36,149 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:53:36,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:53:36,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1149766717] [2024-11-17 02:53:36,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1149766717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:53:36,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:53:36,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:53:36,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308227614] [2024-11-17 02:53:36,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:53:36,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:53:36,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:53:36,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:53:36,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:53:36,151 INFO L87 Difference]: Start difference. First operand 1508 states and 1829 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:36,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:53:36,174 INFO L93 Difference]: Finished difference Result 1448 states and 1743 transitions. [2024-11-17 02:53:36,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:53:36,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-17 02:53:36,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:53:36,177 INFO L225 Difference]: With dead ends: 1448 [2024-11-17 02:53:36,177 INFO L226 Difference]: Without dead ends: 1448 [2024-11-17 02:53:36,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:53:36,178 INFO L432 NwaCegarLoop]: 1212 mSDtfsCounter, 71 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2360 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:53:36,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2360 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:53:36,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2024-11-17 02:53:36,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1448. [2024-11-17 02:53:36,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1448 states, 922 states have (on average 1.8774403470715835) internal successors, (1731), 1439 states have internal predecessors, (1731), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 02:53:36,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 1743 transitions. [2024-11-17 02:53:36,194 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 1743 transitions. Word has length 17 [2024-11-17 02:53:36,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:53:36,194 INFO L471 AbstractCegarLoop]: Abstraction has 1448 states and 1743 transitions. [2024-11-17 02:53:36,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:36,194 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1743 transitions. [2024-11-17 02:53:36,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 02:53:36,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:36,195 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:53:36,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-17 02:53:36,395 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-17 02:53:36,395 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr273REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:53:36,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:36,396 INFO L85 PathProgramCache]: Analyzing trace with hash -874179550, now seen corresponding path program 1 times [2024-11-17 02:53:36,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:36,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535341728] [2024-11-17 02:53:36,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:53:36,413 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-17 02:53:36,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:36,417 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-17 02:53:36,421 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-17 02:53:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:53:36,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:53:36,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:53:36,541 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-17 02:53:36,542 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:53:36,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:53:36,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535341728] [2024-11-17 02:53:36,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535341728] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:53:36,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:53:36,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:53:36,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911183426] [2024-11-17 02:53:36,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:53:36,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:53:36,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:53:36,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:53:36,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:53:36,543 INFO L87 Difference]: Start difference. First operand 1448 states and 1743 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:36,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:53:36,596 INFO L93 Difference]: Finished difference Result 1418 states and 1685 transitions. [2024-11-17 02:53:36,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:53:36,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-17 02:53:36,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:53:36,599 INFO L225 Difference]: With dead ends: 1418 [2024-11-17 02:53:36,599 INFO L226 Difference]: Without dead ends: 1418 [2024-11-17 02:53:36,599 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:53:36,600 INFO L432 NwaCegarLoop]: 1167 mSDtfsCounter, 48 mSDsluCounter, 2307 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3474 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:53:36,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3474 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:53:36,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2024-11-17 02:53:36,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 1418. [2024-11-17 02:53:36,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 906 states have (on average 1.846578366445916) internal successors, (1673), 1409 states have internal predecessors, (1673), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 02:53:36,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1685 transitions. [2024-11-17 02:53:36,614 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 1685 transitions. Word has length 19 [2024-11-17 02:53:36,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:53:36,614 INFO L471 AbstractCegarLoop]: Abstraction has 1418 states and 1685 transitions. [2024-11-17 02:53:36,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:36,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1685 transitions. [2024-11-17 02:53:36,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 02:53:36,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:36,615 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:53:36,622 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-17 02:53:36,817 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-17 02:53:36,818 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr613REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:53:36,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:36,822 INFO L85 PathProgramCache]: Analyzing trace with hash 1955354442, now seen corresponding path program 1 times [2024-11-17 02:53:36,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:36,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777290361] [2024-11-17 02:53:36,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:53:36,825 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-17 02:53:36,825 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:36,828 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-17 02:53:36,836 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-17 02:53:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:53:36,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-17 02:53:36,973 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:53:36,982 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-17 02:53:36,982 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:53:36,982 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:53:36,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777290361] [2024-11-17 02:53:36,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777290361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:53:36,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:53:36,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:53:36,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932609979] [2024-11-17 02:53:36,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:53:36,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:53:36,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:53:36,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:53:36,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:53:36,984 INFO L87 Difference]: Start difference. First operand 1418 states and 1685 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:37,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:53:37,006 INFO L93 Difference]: Finished difference Result 1358 states and 1599 transitions. [2024-11-17 02:53:37,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:53:37,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-17 02:53:37,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:53:37,009 INFO L225 Difference]: With dead ends: 1358 [2024-11-17 02:53:37,010 INFO L226 Difference]: Without dead ends: 1358 [2024-11-17 02:53:37,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:53:37,011 INFO L432 NwaCegarLoop]: 1134 mSDtfsCounter, 71 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2204 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:53:37,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2204 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:53:37,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2024-11-17 02:53:37,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 1358. [2024-11-17 02:53:37,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 870 states have (on average 1.8241379310344827) internal successors, (1587), 1349 states have internal predecessors, (1587), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 02:53:37,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1599 transitions. [2024-11-17 02:53:37,030 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1599 transitions. Word has length 21 [2024-11-17 02:53:37,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:53:37,031 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 1599 transitions. [2024-11-17 02:53:37,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:37,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1599 transitions. [2024-11-17 02:53:37,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-17 02:53:37,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:37,032 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] [2024-11-17 02:53:37,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-17 02:53:37,232 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-17 02:53:37,233 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:53:37,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:37,233 INFO L85 PathProgramCache]: Analyzing trace with hash 107266867, now seen corresponding path program 1 times [2024-11-17 02:53:37,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:37,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1558678847] [2024-11-17 02:53:37,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:53:37,234 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-17 02:53:37,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:37,238 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-17 02:53:37,239 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-17 02:53:37,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:53:37,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 02:53:37,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:53:37,503 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#i~0#1.base_49| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_49| (_ bv0 1)) |c_#valid|) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#i~0#1.base_49|)))) is different from true [2024-11-17 02:53:37,512 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-17 02:53:37,512 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:53:37,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:53:37,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1558678847] [2024-11-17 02:53:37,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1558678847] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:53:37,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:53:37,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:53:37,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169764138] [2024-11-17 02:53:37,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:53:37,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:53:37,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:53:37,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:53:37,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-17 02:53:37,513 INFO L87 Difference]: Start difference. First operand 1358 states and 1599 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:38,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:53:38,799 INFO L93 Difference]: Finished difference Result 1671 states and 1987 transitions. [2024-11-17 02:53:38,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:53:38,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-17 02:53:38,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:53:38,803 INFO L225 Difference]: With dead ends: 1671 [2024-11-17 02:53:38,803 INFO L226 Difference]: Without dead ends: 1660 [2024-11-17 02:53:38,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2024-11-17 02:53:38,804 INFO L432 NwaCegarLoop]: 1042 mSDtfsCounter, 252 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 1675 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1419 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-17 02:53:38,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 1675 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 624 Invalid, 0 Unknown, 1419 Unchecked, 1.3s Time] [2024-11-17 02:53:38,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2024-11-17 02:53:38,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1418. [2024-11-17 02:53:38,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1418 states, 929 states have (on average 1.7857911733046286) internal successors, (1659), 1408 states have internal predecessors, (1659), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-17 02:53:38,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1673 transitions. [2024-11-17 02:53:38,817 INFO L78 Accepts]: Start accepts. Automaton has 1418 states and 1673 transitions. Word has length 22 [2024-11-17 02:53:38,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:53:38,817 INFO L471 AbstractCegarLoop]: Abstraction has 1418 states and 1673 transitions. [2024-11-17 02:53:38,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:38,818 INFO L276 IsEmpty]: Start isEmpty. Operand 1418 states and 1673 transitions. [2024-11-17 02:53:38,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 02:53:38,818 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:38,818 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] [2024-11-17 02:53:38,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 (12)] Forceful destruction successful, exit code 0 [2024-11-17 02:53:39,022 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-17 02:53:39,022 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr589REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:53:39,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:39,023 INFO L85 PathProgramCache]: Analyzing trace with hash -2100084898, now seen corresponding path program 1 times [2024-11-17 02:53:39,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:39,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894190248] [2024-11-17 02:53:39,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:53:39,024 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-17 02:53:39,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:39,026 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-17 02:53:39,027 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-17 02:53:39,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:53:39,157 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:53:39,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:53:39,176 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-17 02:53:39,177 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:53:39,177 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:53:39,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894190248] [2024-11-17 02:53:39,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894190248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:53:39,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:53:39,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:53:39,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737312281] [2024-11-17 02:53:39,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:53:39,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:53:39,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:53:39,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:53:39,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:53:39,178 INFO L87 Difference]: Start difference. First operand 1418 states and 1673 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:39,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:53:39,231 INFO L93 Difference]: Finished difference Result 1388 states and 1615 transitions. [2024-11-17 02:53:39,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:53:39,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-17 02:53:39,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:53:39,235 INFO L225 Difference]: With dead ends: 1388 [2024-11-17 02:53:39,235 INFO L226 Difference]: Without dead ends: 1388 [2024-11-17 02:53:39,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:53:39,236 INFO L432 NwaCegarLoop]: 1089 mSDtfsCounter, 48 mSDsluCounter, 2151 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3240 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:53:39,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3240 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:53:39,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-11-17 02:53:39,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1388. [2024-11-17 02:53:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 913 states have (on average 1.7535596933187294) internal successors, (1601), 1378 states have internal predecessors, (1601), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-17 02:53:39,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1615 transitions. [2024-11-17 02:53:39,249 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1615 transitions. Word has length 23 [2024-11-17 02:53:39,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:53:39,249 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 1615 transitions. [2024-11-17 02:53:39,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:39,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1615 transitions. [2024-11-17 02:53:39,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-17 02:53:39,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:39,250 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-17 02:53:39,259 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-17 02:53:39,450 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-17 02:53:39,451 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr259REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:53:39,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:39,451 INFO L85 PathProgramCache]: Analyzing trace with hash -2107618696, now seen corresponding path program 1 times [2024-11-17 02:53:39,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:39,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032188007] [2024-11-17 02:53:39,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:53:39,452 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-17 02:53:39,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:39,453 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-17 02:53:39,455 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-17 02:53:39,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:53:39,566 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:53:39,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:53:39,572 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-17 02:53:39,623 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-17 02:53:39,623 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:53:39,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:53:39,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032188007] [2024-11-17 02:53:39,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032188007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:53:39,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:53:39,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:53:39,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821791145] [2024-11-17 02:53:39,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:53:39,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:53:39,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:53:39,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:53:39,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:53:39,625 INFO L87 Difference]: Start difference. First operand 1388 states and 1615 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:41,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:53:41,258 INFO L93 Difference]: Finished difference Result 1590 states and 1818 transitions. [2024-11-17 02:53:41,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:53:41,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-17 02:53:41,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:53:41,262 INFO L225 Difference]: With dead ends: 1590 [2024-11-17 02:53:41,263 INFO L226 Difference]: Without dead ends: 1590 [2024-11-17 02:53:41,264 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:53:41,264 INFO L432 NwaCegarLoop]: 678 mSDtfsCounter, 990 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 995 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:53:41,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [995 Valid, 1427 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-17 02:53:41,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2024-11-17 02:53:41,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1384. [2024-11-17 02:53:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 913 states have (on average 1.7404162102957283) internal successors, (1589), 1374 states have internal predecessors, (1589), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-17 02:53:41,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1603 transitions. [2024-11-17 02:53:41,277 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1603 transitions. Word has length 33 [2024-11-17 02:53:41,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:53:41,277 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 1603 transitions. [2024-11-17 02:53:41,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:41,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1603 transitions. [2024-11-17 02:53:41,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-17 02:53:41,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:41,278 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-17 02:53:41,291 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 (14)] Forceful destruction successful, exit code 0 [2024-11-17 02:53:41,479 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-17 02:53:41,479 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr260REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:53:41,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:41,479 INFO L85 PathProgramCache]: Analyzing trace with hash -2107618695, now seen corresponding path program 1 times [2024-11-17 02:53:41,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:41,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049418256] [2024-11-17 02:53:41,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:53:41,480 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-17 02:53:41,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:41,484 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-17 02:53:41,496 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-17 02:53:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:53:41,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 02:53:41,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:53:41,619 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-17 02:53:41,744 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-17 02:53:41,745 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:53:41,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:53:41,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049418256] [2024-11-17 02:53:41,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049418256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:53:41,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:53:41,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:53:41,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198688889] [2024-11-17 02:53:41,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:53:41,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:53:41,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:53:41,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:53:41,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:53:41,746 INFO L87 Difference]: Start difference. First operand 1384 states and 1603 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:44,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:53:44,237 INFO L93 Difference]: Finished difference Result 2092 states and 2446 transitions. [2024-11-17 02:53:44,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:53:44,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-17 02:53:44,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:53:44,242 INFO L225 Difference]: With dead ends: 2092 [2024-11-17 02:53:44,242 INFO L226 Difference]: Without dead ends: 2092 [2024-11-17 02:53:44,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:53:44,243 INFO L432 NwaCegarLoop]: 863 mSDtfsCounter, 592 mSDsluCounter, 1181 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 2044 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:53:44,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [594 Valid, 2044 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-17 02:53:44,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2092 states. [2024-11-17 02:53:44,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2092 to 1716. [2024-11-17 02:53:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1716 states, 1243 states have (on average 1.750603378921963) internal successors, (2176), 1704 states have internal predecessors, (2176), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:53:44,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1716 states to 1716 states and 2194 transitions. [2024-11-17 02:53:44,259 INFO L78 Accepts]: Start accepts. Automaton has 1716 states and 2194 transitions. Word has length 33 [2024-11-17 02:53:44,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:53:44,259 INFO L471 AbstractCegarLoop]: Abstraction has 1716 states and 2194 transitions. [2024-11-17 02:53:44,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:44,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1716 states and 2194 transitions. [2024-11-17 02:53:44,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 02:53:44,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:44,260 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] [2024-11-17 02:53:44,269 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-17 02:53:44,461 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-17 02:53:44,461 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr575REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:53:44,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:44,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1693240372, now seen corresponding path program 1 times [2024-11-17 02:53:44,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:44,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928096061] [2024-11-17 02:53:44,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:53:44,462 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:53:44,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:44,464 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-17 02:53:44,465 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-17 02:53:44,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:53:44,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:53:44,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:53:44,616 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-17 02:53:44,743 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-17 02:53:44,743 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:53:44,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:53:44,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928096061] [2024-11-17 02:53:44,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928096061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:53:44,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:53:44,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:53:44,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112240102] [2024-11-17 02:53:44,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:53:44,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:53:44,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:53:44,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:53:44,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:53:44,746 INFO L87 Difference]: Start difference. First operand 1716 states and 2194 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:46,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:53:46,530 INFO L93 Difference]: Finished difference Result 2183 states and 2785 transitions. [2024-11-17 02:53:46,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:53:46,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-17 02:53:46,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:53:46,542 INFO L225 Difference]: With dead ends: 2183 [2024-11-17 02:53:46,543 INFO L226 Difference]: Without dead ends: 2183 [2024-11-17 02:53:46,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:53:46,543 INFO L432 NwaCegarLoop]: 1035 mSDtfsCounter, 802 mSDsluCounter, 1057 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 2092 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:53:46,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 2092 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-17 02:53:46,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2183 states. [2024-11-17 02:53:46,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2183 to 1712. [2024-11-17 02:53:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1243 states have (on average 1.7441673370876911) internal successors, (2168), 1700 states have internal predecessors, (2168), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:53:46,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2186 transitions. [2024-11-17 02:53:46,580 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2186 transitions. Word has length 37 [2024-11-17 02:53:46,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:53:46,580 INFO L471 AbstractCegarLoop]: Abstraction has 1712 states and 2186 transitions. [2024-11-17 02:53:46,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:46,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2186 transitions. [2024-11-17 02:53:46,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 02:53:46,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:46,581 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] [2024-11-17 02:53:46,585 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-17 02:53:46,782 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-17 02:53:46,782 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr576REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:53:46,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:46,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1693240373, now seen corresponding path program 1 times [2024-11-17 02:53:46,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:46,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932699462] [2024-11-17 02:53:46,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:53:46,783 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-17 02:53:46,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:46,786 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-17 02:53:46,787 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-17 02:53:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:53:46,929 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-17 02:53:46,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:53:46,939 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-17 02:53:47,191 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-17 02:53:47,193 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:53:47,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:53:47,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932699462] [2024-11-17 02:53:47,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932699462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:53:47,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:53:47,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:53:47,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91286905] [2024-11-17 02:53:47,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:53:47,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:53:47,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:53:47,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:53:47,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:53:47,195 INFO L87 Difference]: Start difference. First operand 1712 states and 2186 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:49,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:53:49,231 INFO L93 Difference]: Finished difference Result 2245 states and 2811 transitions. [2024-11-17 02:53:49,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:53:49,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-17 02:53:49,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:53:49,236 INFO L225 Difference]: With dead ends: 2245 [2024-11-17 02:53:49,236 INFO L226 Difference]: Without dead ends: 2245 [2024-11-17 02:53:49,236 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:53:49,237 INFO L432 NwaCegarLoop]: 1322 mSDtfsCounter, 557 mSDsluCounter, 1336 mSDsCounter, 0 mSdLazyCounter, 1404 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 2658 SdHoareTripleChecker+Invalid, 1407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:53:49,237 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 2658 Invalid, 1407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1404 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-17 02:53:49,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2024-11-17 02:53:49,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 1708. [2024-11-17 02:53:49,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1708 states, 1243 states have (on average 1.7377312952534192) internal successors, (2160), 1696 states have internal predecessors, (2160), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:53:49,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1708 states to 1708 states and 2178 transitions. [2024-11-17 02:53:49,259 INFO L78 Accepts]: Start accepts. Automaton has 1708 states and 2178 transitions. Word has length 37 [2024-11-17 02:53:49,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:53:49,260 INFO L471 AbstractCegarLoop]: Abstraction has 1708 states and 2178 transitions. [2024-11-17 02:53:49,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:49,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1708 states and 2178 transitions. [2024-11-17 02:53:49,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-17 02:53:49,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:49,260 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:53:49,269 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-17 02:53:49,460 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-17 02:53:49,461 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr213REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:53:49,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:49,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1385687047, now seen corresponding path program 1 times [2024-11-17 02:53:49,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:49,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17728118] [2024-11-17 02:53:49,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:53:49,462 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:53:49,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:49,465 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-17 02:53:49,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-17 02:53:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:53:49,592 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:53:49,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:53:49,620 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-17 02:53:49,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:53:49,621 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:53:49,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17728118] [2024-11-17 02:53:49,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17728118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:53:49,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:53:49,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:53:49,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879054254] [2024-11-17 02:53:49,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:53:49,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:53:49,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:53:49,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:53:49,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:53:49,622 INFO L87 Difference]: Start difference. First operand 1708 states and 2178 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:49,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:53:49,664 INFO L93 Difference]: Finished difference Result 1678 states and 2128 transitions. [2024-11-17 02:53:49,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:53:49,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-17 02:53:49,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:53:49,667 INFO L225 Difference]: With dead ends: 1678 [2024-11-17 02:53:49,667 INFO L226 Difference]: Without dead ends: 1678 [2024-11-17 02:53:49,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:53:49,668 INFO L432 NwaCegarLoop]: 1079 mSDtfsCounter, 27 mSDsluCounter, 2120 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 3199 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:53:49,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 3199 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:53:49,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2024-11-17 02:53:49,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1678. [2024-11-17 02:53:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1678 states, 1213 states have (on average 1.7394888705688376) internal successors, (2110), 1666 states have internal predecessors, (2110), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:53:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 2128 transitions. [2024-11-17 02:53:49,682 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 2128 transitions. Word has length 52 [2024-11-17 02:53:49,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:53:49,683 INFO L471 AbstractCegarLoop]: Abstraction has 1678 states and 2128 transitions. [2024-11-17 02:53:49,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:49,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 2128 transitions. [2024-11-17 02:53:49,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-17 02:53:49,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:49,683 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:53:49,688 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-17 02:53:49,884 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-17 02:53:49,884 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr532REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:53:49,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:49,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1543105105, now seen corresponding path program 1 times [2024-11-17 02:53:49,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:49,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1851939072] [2024-11-17 02:53:49,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:53:49,885 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-17 02:53:49,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:49,887 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-17 02:53:49,889 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-17 02:53:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:53:50,133 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:53:50,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:53:50,187 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-17 02:53:50,187 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:53:50,187 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:53:50,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1851939072] [2024-11-17 02:53:50,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1851939072] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:53:50,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:53:50,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:53:50,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836158826] [2024-11-17 02:53:50,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:53:50,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:53:50,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:53:50,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:53:50,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:53:50,190 INFO L87 Difference]: Start difference. First operand 1678 states and 2128 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:50,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:53:50,235 INFO L93 Difference]: Finished difference Result 1666 states and 2108 transitions. [2024-11-17 02:53:50,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:53:50,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-17 02:53:50,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:53:50,238 INFO L225 Difference]: With dead ends: 1666 [2024-11-17 02:53:50,242 INFO L226 Difference]: Without dead ends: 1666 [2024-11-17 02:53:50,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:53:50,242 INFO L432 NwaCegarLoop]: 1075 mSDtfsCounter, 21 mSDsluCounter, 2118 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3193 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:53:50,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3193 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:53:50,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2024-11-17 02:53:50,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1666. [2024-11-17 02:53:50,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1666 states, 1201 states have (on average 1.7402164862614489) internal successors, (2090), 1654 states have internal predecessors, (2090), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-17 02:53:50,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1666 states to 1666 states and 2108 transitions. [2024-11-17 02:53:50,268 INFO L78 Accepts]: Start accepts. Automaton has 1666 states and 2108 transitions. Word has length 57 [2024-11-17 02:53:50,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:53:50,270 INFO L471 AbstractCegarLoop]: Abstraction has 1666 states and 2108 transitions. [2024-11-17 02:53:50,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:50,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1666 states and 2108 transitions. [2024-11-17 02:53:50,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-17 02:53:50,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:50,271 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:53:50,280 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-17 02:53:50,471 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-17 02:53:50,472 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr213REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:53:50,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:50,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1979040191, now seen corresponding path program 1 times [2024-11-17 02:53:50,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:50,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1215371850] [2024-11-17 02:53:50,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:53:50,473 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-17 02:53:50,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:50,475 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-17 02:53:50,480 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-17 02:53:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:53:50,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:53:50,626 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:53:50,651 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-17 02:53:50,651 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:53:50,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:53:50,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1215371850] [2024-11-17 02:53:50,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1215371850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:53:50,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:53:50,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:53:50,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722708881] [2024-11-17 02:53:50,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:53:50,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:53:50,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:53:50,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:53:50,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:53:50,653 INFO L87 Difference]: Start difference. First operand 1666 states and 2108 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:50,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:53:50,732 INFO L93 Difference]: Finished difference Result 1657 states and 1768 transitions. [2024-11-17 02:53:50,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:53:50,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2024-11-17 02:53:50,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:53:50,735 INFO L225 Difference]: With dead ends: 1657 [2024-11-17 02:53:50,739 INFO L226 Difference]: Without dead ends: 1657 [2024-11-17 02:53:50,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:53:50,740 INFO L432 NwaCegarLoop]: 1373 mSDtfsCounter, 327 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 2392 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:53:50,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 2392 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:53:50,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2024-11-17 02:53:50,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1284. [2024-11-17 02:53:50,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 821 states have (on average 1.6601705237515225) internal successors, (1363), 1274 states have internal predecessors, (1363), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-17 02:53:50,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 1377 transitions. [2024-11-17 02:53:50,755 INFO L78 Accepts]: Start accepts. Automaton has 1284 states and 1377 transitions. Word has length 60 [2024-11-17 02:53:50,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:53:50,755 INFO L471 AbstractCegarLoop]: Abstraction has 1284 states and 1377 transitions. [2024-11-17 02:53:50,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:50,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1284 states and 1377 transitions. [2024-11-17 02:53:50,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-11-17 02:53:50,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:50,759 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:53:50,764 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-17 02:53:50,959 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-17 02:53:50,960 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:53:50,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:50,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1530695814, now seen corresponding path program 1 times [2024-11-17 02:53:50,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:50,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833375395] [2024-11-17 02:53:50,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:53:50,961 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-17 02:53:50,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:50,964 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-17 02:53:50,965 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-17 02:53:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:53:51,154 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 02:53:51,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:53:51,167 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 02:53:51,168 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 02:53:51,169 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-17 02:53:51,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2024-11-17 02:53:51,236 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-17 02:53:51,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2024-11-17 02:53:51,273 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-17 02:53:51,274 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:53:51,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:53:51,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833375395] [2024-11-17 02:53:51,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833375395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:53:51,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:53:51,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 02:53:51,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753936570] [2024-11-17 02:53:51,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:53:51,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-17 02:53:51,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:53:51,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-17 02:53:51,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:53:51,275 INFO L87 Difference]: Start difference. First operand 1284 states and 1377 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:51,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:53:51,561 INFO L93 Difference]: Finished difference Result 1972 states and 2101 transitions. [2024-11-17 02:53:51,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:53:51,565 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2024-11-17 02:53:51,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:53:51,568 INFO L225 Difference]: With dead ends: 1972 [2024-11-17 02:53:51,569 INFO L226 Difference]: Without dead ends: 1968 [2024-11-17 02:53:51,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 02:53:51,570 INFO L432 NwaCegarLoop]: 1289 mSDtfsCounter, 1622 mSDsluCounter, 3619 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1630 SdHoareTripleChecker+Valid, 4908 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:53:51,571 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1630 Valid, 4908 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 02:53:51,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2024-11-17 02:53:51,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1229. [2024-11-17 02:53:51,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 767 states have (on average 1.7053455019556714) internal successors, (1308), 1220 states have internal predecessors, (1308), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 02:53:51,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1320 transitions. [2024-11-17 02:53:51,592 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1320 transitions. Word has length 63 [2024-11-17 02:53:51,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:53:51,592 INFO L471 AbstractCegarLoop]: Abstraction has 1229 states and 1320 transitions. [2024-11-17 02:53:51,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:51,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1320 transitions. [2024-11-17 02:53:51,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-17 02:53:51,593 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:51,593 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:53:51,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2024-11-17 02:53:51,793 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-17 02:53:51,794 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr532REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:53:51,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:51,795 INFO L85 PathProgramCache]: Analyzing trace with hash -189036297, now seen corresponding path program 1 times [2024-11-17 02:53:51,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:51,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096008225] [2024-11-17 02:53:51,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:53:51,795 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-17 02:53:51,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:51,796 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-17 02:53:51,797 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-17 02:53:52,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:53:52,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-17 02:53:52,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:53:52,092 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-17 02:53:52,097 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-17 02:53:52,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-17 02:53:52,470 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-17 02:53:52,480 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-17 02:53:52,481 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-17 02:53:52,490 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-17 02:53:52,490 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:53:52,490 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:53:52,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096008225] [2024-11-17 02:53:52,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096008225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:53:52,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:53:52,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:53:52,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915876335] [2024-11-17 02:53:52,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:53:52,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:53:52,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:53:52,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:53:52,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:53:52,493 INFO L87 Difference]: Start difference. First operand 1229 states and 1320 transitions. Second operand has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:54,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:53:54,359 INFO L93 Difference]: Finished difference Result 1574 states and 1689 transitions. [2024-11-17 02:53:54,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:53:54,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-17 02:53:54,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:53:54,362 INFO L225 Difference]: With dead ends: 1574 [2024-11-17 02:53:54,362 INFO L226 Difference]: Without dead ends: 1574 [2024-11-17 02:53:54,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:53:54,363 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 1778 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1783 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:53:54,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1783 Valid, 804 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-17 02:53:54,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2024-11-17 02:53:54,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1152. [2024-11-17 02:53:54,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1152 states, 728 states have (on average 1.64010989010989) internal successors, (1194), 1143 states have internal predecessors, (1194), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 02:53:54,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1206 transitions. [2024-11-17 02:53:54,373 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1206 transitions. Word has length 65 [2024-11-17 02:53:54,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:53:54,373 INFO L471 AbstractCegarLoop]: Abstraction has 1152 states and 1206 transitions. [2024-11-17 02:53:54,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:54,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1206 transitions. [2024-11-17 02:53:54,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-17 02:53:54,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:54,373 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:53:54,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2024-11-17 02:53:54,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:53:54,574 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr525REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:53:54,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:54,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1056299505, now seen corresponding path program 1 times [2024-11-17 02:53:54,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:54,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909378961] [2024-11-17 02:53:54,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:53:54,575 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-17 02:53:54,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:54,578 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:53:54,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2024-11-17 02:53:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:53:54,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 02:53:54,842 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:53:54,849 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-17 02:53:54,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:53:54,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-17 02:53:54,891 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-17 02:53:54,891 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:53:54,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:53:54,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909378961] [2024-11-17 02:53:54,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909378961] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:53:54,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:53:54,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:53:54,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345919873] [2024-11-17 02:53:54,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:53:54,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:53:54,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:53:54,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:53:54,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:53:54,893 INFO L87 Difference]: Start difference. First operand 1152 states and 1206 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:56,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:53:56,771 INFO L93 Difference]: Finished difference Result 1151 states and 1205 transitions. [2024-11-17 02:53:56,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:53:56,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-17 02:53:56,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:53:56,775 INFO L225 Difference]: With dead ends: 1151 [2024-11-17 02:53:56,775 INFO L226 Difference]: Without dead ends: 1151 [2024-11-17 02:53:56,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:53:56,779 INFO L432 NwaCegarLoop]: 1048 mSDtfsCounter, 2 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 1484 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2715 SdHoareTripleChecker+Invalid, 1485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:53:56,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2715 Invalid, 1485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1484 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-17 02:53:56,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2024-11-17 02:53:56,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 1151. [2024-11-17 02:53:56,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1151 states, 728 states have (on average 1.6387362637362637) internal successors, (1193), 1142 states have internal predecessors, (1193), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 02:53:56,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1205 transitions. [2024-11-17 02:53:56,792 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1205 transitions. Word has length 70 [2024-11-17 02:53:56,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:53:56,792 INFO L471 AbstractCegarLoop]: Abstraction has 1151 states and 1205 transitions. [2024-11-17 02:53:56,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:56,792 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1205 transitions. [2024-11-17 02:53:56,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-17 02:53:56,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:56,793 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:53:56,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2024-11-17 02:53:56,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:53:56,997 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr526REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:53:56,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:56,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1056299504, now seen corresponding path program 1 times [2024-11-17 02:53:56,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:56,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1479944465] [2024-11-17 02:53:56,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:53:56,998 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-17 02:53:56,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:57,000 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:53:57,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2024-11-17 02:53:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:53:57,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-17 02:53:57,221 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:53:57,229 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-17 02:53:57,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-17 02:53:57,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:53:57,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-17 02:53:57,290 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-17 02:53:57,290 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:53:57,290 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:53:57,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1479944465] [2024-11-17 02:53:57,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1479944465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:53:57,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:53:57,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:53:57,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199902088] [2024-11-17 02:53:57,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:53:57,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:53:57,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:53:57,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:53:57,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:53:57,292 INFO L87 Difference]: Start difference. First operand 1151 states and 1205 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:59,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:53:59,646 INFO L93 Difference]: Finished difference Result 1150 states and 1204 transitions. [2024-11-17 02:53:59,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:53:59,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-11-17 02:53:59,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:53:59,648 INFO L225 Difference]: With dead ends: 1150 [2024-11-17 02:53:59,648 INFO L226 Difference]: Without dead ends: 1150 [2024-11-17 02:53:59,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:53:59,649 INFO L432 NwaCegarLoop]: 1048 mSDtfsCounter, 1 mSDsluCounter, 1727 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2775 SdHoareTripleChecker+Invalid, 1422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-17 02:53:59,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2775 Invalid, 1422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-17 02:53:59,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1150 states. [2024-11-17 02:53:59,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1150 to 1150. [2024-11-17 02:53:59,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1150 states, 727 states have (on average 1.639614855570839) internal successors, (1192), 1141 states have internal predecessors, (1192), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-17 02:53:59,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1150 states to 1150 states and 1204 transitions. [2024-11-17 02:53:59,657 INFO L78 Accepts]: Start accepts. Automaton has 1150 states and 1204 transitions. Word has length 70 [2024-11-17 02:53:59,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:53:59,657 INFO L471 AbstractCegarLoop]: Abstraction has 1150 states and 1204 transitions. [2024-11-17 02:53:59,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:53:59,658 INFO L276 IsEmpty]: Start isEmpty. Operand 1150 states and 1204 transitions. [2024-11-17 02:53:59,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-17 02:53:59,658 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:53:59,658 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:53:59,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2024-11-17 02:53:59,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:53:59,859 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr521REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:53:59,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:53:59,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1598286708, now seen corresponding path program 1 times [2024-11-17 02:53:59,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:53:59,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123671492] [2024-11-17 02:53:59,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:53:59,860 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-17 02:53:59,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:53:59,863 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:53:59,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2024-11-17 02:54:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:54:00,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-17 02:54:00,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:54:00,098 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-17 02:54:00,099 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-17 02:54:00,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:54:00,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123671492] [2024-11-17 02:54:00,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [123671492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:54:00,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:54:00,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:54:00,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899641661] [2024-11-17 02:54:00,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:54:00,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:54:00,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:54:00,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:54:00,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:54:00,101 INFO L87 Difference]: Start difference. First operand 1150 states and 1204 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-17 02:54:00,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:54:00,128 INFO L93 Difference]: Finished difference Result 1153 states and 1208 transitions. [2024-11-17 02:54:00,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:54:00,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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 78 [2024-11-17 02:54:00,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:54:00,132 INFO L225 Difference]: With dead ends: 1153 [2024-11-17 02:54:00,132 INFO L226 Difference]: Without dead ends: 1153 [2024-11-17 02:54:00,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 75 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-17 02:54:00,133 INFO L432 NwaCegarLoop]: 1048 mSDtfsCounter, 0 mSDsluCounter, 2091 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3139 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:54:00,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3139 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-17 02:54:00,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1153 states. [2024-11-17 02:54:00,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1153 to 1153. [2024-11-17 02:54:00,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1153 states, 729 states have (on average 1.6392318244170097) internal successors, (1195), 1144 states have internal predecessors, (1195), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-17 02:54:00,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1153 states to 1153 states and 1208 transitions. [2024-11-17 02:54:00,143 INFO L78 Accepts]: Start accepts. Automaton has 1153 states and 1208 transitions. Word has length 78 [2024-11-17 02:54:00,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:54:00,144 INFO L471 AbstractCegarLoop]: Abstraction has 1153 states and 1208 transitions. [2024-11-17 02:54:00,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 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-17 02:54:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1153 states and 1208 transitions. [2024-11-17 02:54:00,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-17 02:54:00,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:54:00,144 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:54:00,151 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Ended with exit code 0 [2024-11-17 02:54:00,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:54:00,345 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr521REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:54:00,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:54:00,346 INFO L85 PathProgramCache]: Analyzing trace with hash -306843566, now seen corresponding path program 1 times [2024-11-17 02:54:00,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:54:00,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085543651] [2024-11-17 02:54:00,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:54:00,347 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-17 02:54:00,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:54:00,349 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:54:00,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2024-11-17 02:54:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:54:00,585 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-17 02:54:00,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:54:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:54:00,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:54:00,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:54:00,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:54:00,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085543651] [2024-11-17 02:54:00,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085543651] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:54:00,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:54:00,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-17 02:54:00,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910022485] [2024-11-17 02:54:00,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:54:00,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-17 02:54:00,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:54:00,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-17 02:54:00,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-17 02:54:00,658 INFO L87 Difference]: Start difference. First operand 1153 states and 1208 transitions. Second operand has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:54:00,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:54:00,784 INFO L93 Difference]: Finished difference Result 1165 states and 1225 transitions. [2024-11-17 02:54:00,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 02:54:00,785 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 79 [2024-11-17 02:54:00,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:54:00,787 INFO L225 Difference]: With dead ends: 1165 [2024-11-17 02:54:00,787 INFO L226 Difference]: Without dead ends: 1165 [2024-11-17 02:54:00,787 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-17 02:54:00,788 INFO L432 NwaCegarLoop]: 1048 mSDtfsCounter, 6 mSDsluCounter, 3135 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4183 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:54:00,788 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4183 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:54:00,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2024-11-17 02:54:00,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1163. [2024-11-17 02:54:00,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 738 states have (on average 1.6395663956639566) internal successors, (1210), 1153 states have internal predecessors, (1210), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-17 02:54:00,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1223 transitions. [2024-11-17 02:54:00,799 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1223 transitions. Word has length 79 [2024-11-17 02:54:00,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:54:00,799 INFO L471 AbstractCegarLoop]: Abstraction has 1163 states and 1223 transitions. [2024-11-17 02:54:00,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.125) internal successors, (81), 8 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:54:00,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1223 transitions. [2024-11-17 02:54:00,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-11-17 02:54:00,800 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:54:00,800 INFO L215 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:54:00,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2024-11-17 02:54:01,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:54:01,001 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr521REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:54:01,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:54:01,001 INFO L85 PathProgramCache]: Analyzing trace with hash -29895156, now seen corresponding path program 2 times [2024-11-17 02:54:01,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:54:01,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1856746258] [2024-11-17 02:54:01,002 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-17 02:54:01,002 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-17 02:54:01,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:54:01,003 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:54:01,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2024-11-17 02:54:01,408 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-17 02:54:01,409 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:54:01,422 INFO L255 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-17 02:54:01,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:54:01,462 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:54:01,463 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:54:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:54:01,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:54:01,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1856746258] [2024-11-17 02:54:01,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1856746258] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:54:01,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:54:01,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-17 02:54:01,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12485353] [2024-11-17 02:54:01,571 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:54:01,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 02:54:01,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:54:01,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 02:54:01,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-17 02:54:01,572 INFO L87 Difference]: Start difference. First operand 1163 states and 1223 transitions. Second operand has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:54:01,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:54:01,903 INFO L93 Difference]: Finished difference Result 1178 states and 1245 transitions. [2024-11-17 02:54:01,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-17 02:54:01,904 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 82 [2024-11-17 02:54:01,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:54:01,908 INFO L225 Difference]: With dead ends: 1178 [2024-11-17 02:54:01,908 INFO L226 Difference]: Without dead ends: 1174 [2024-11-17 02:54:01,908 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-17 02:54:01,909 INFO L432 NwaCegarLoop]: 1048 mSDtfsCounter, 12 mSDsluCounter, 5228 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6276 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:54:01,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6276 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 02:54:01,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2024-11-17 02:54:01,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 1172. [2024-11-17 02:54:01,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 747 states have (on average 1.6358768406961177) internal successors, (1222), 1162 states have internal predecessors, (1222), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-17 02:54:01,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 1235 transitions. [2024-11-17 02:54:01,922 INFO L78 Accepts]: Start accepts. Automaton has 1172 states and 1235 transitions. Word has length 82 [2024-11-17 02:54:01,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:54:01,922 INFO L471 AbstractCegarLoop]: Abstraction has 1172 states and 1235 transitions. [2024-11-17 02:54:01,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.214285714285714) internal successors, (87), 14 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:54:01,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1172 states and 1235 transitions. [2024-11-17 02:54:01,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-17 02:54:01,923 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:54:01,923 INFO L215 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:54:01,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2024-11-17 02:54:02,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:54:02,126 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr521REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:54:02,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:54:02,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1217237068, now seen corresponding path program 3 times [2024-11-17 02:54:02,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:54:02,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591089277] [2024-11-17 02:54:02,128 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-17 02:54:02,128 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-17 02:54:02,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:54:02,129 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:54:02,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-17 02:54:02,781 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-17 02:54:02,781 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:54:02,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-17 02:54:02,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:54:02,905 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:54:02,905 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:54:03,353 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:54:03,354 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:54:03,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591089277] [2024-11-17 02:54:03,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [591089277] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:54:03,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:54:03,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-17 02:54:03,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842115120] [2024-11-17 02:54:03,354 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:54:03,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 02:54:03,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:54:03,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 02:54:03,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-17 02:54:03,355 INFO L87 Difference]: Start difference. First operand 1172 states and 1235 transitions. Second operand has 26 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:54:04,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:54:04,739 INFO L93 Difference]: Finished difference Result 1196 states and 1274 transitions. [2024-11-17 02:54:04,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-17 02:54:04,740 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2024-11-17 02:54:04,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:54:04,743 INFO L225 Difference]: With dead ends: 1196 [2024-11-17 02:54:04,743 INFO L226 Difference]: Without dead ends: 1190 [2024-11-17 02:54:04,744 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-17 02:54:04,744 INFO L432 NwaCegarLoop]: 1049 mSDtfsCounter, 20 mSDsluCounter, 12548 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 13597 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:54:04,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 13597 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 02:54:04,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2024-11-17 02:54:04,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1190. [2024-11-17 02:54:04,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1190 states, 765 states have (on average 1.6274509803921569) internal successors, (1245), 1180 states have internal predecessors, (1245), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-17 02:54:04,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1190 states to 1190 states and 1258 transitions. [2024-11-17 02:54:04,765 INFO L78 Accepts]: Start accepts. Automaton has 1190 states and 1258 transitions. Word has length 88 [2024-11-17 02:54:04,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:54:04,766 INFO L471 AbstractCegarLoop]: Abstraction has 1190 states and 1258 transitions. [2024-11-17 02:54:04,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.8076923076923075) internal successors, (99), 26 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:54:04,766 INFO L276 IsEmpty]: Start isEmpty. Operand 1190 states and 1258 transitions. [2024-11-17 02:54:04,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-17 02:54:04,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:54:04,767 INFO L215 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:54:04,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Ended with exit code 0 [2024-11-17 02:54:04,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:54:04,968 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr521REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:54:04,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:54:04,969 INFO L85 PathProgramCache]: Analyzing trace with hash -2045840180, now seen corresponding path program 4 times [2024-11-17 02:54:04,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:54:04,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205845735] [2024-11-17 02:54:04,969 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-17 02:54:04,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-17 02:54:04,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:54:04,972 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:54:04,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2024-11-17 02:54:05,371 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-17 02:54:05,371 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:54:05,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 577 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-17 02:54:05,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:54:05,837 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:54:05,838 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:54:06,896 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:54:06,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:54:06,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205845735] [2024-11-17 02:54:06,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205845735] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-17 02:54:06,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:54:06,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-17 02:54:06,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909497517] [2024-11-17 02:54:06,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:54:06,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-17 02:54:06,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-17 02:54:06,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-17 02:54:06,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-17 02:54:06,901 INFO L87 Difference]: Start difference. First operand 1190 states and 1258 transitions. Second operand has 50 states, 50 states have (on average 2.46) internal successors, (123), 50 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:54:11,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:54:11,058 INFO L93 Difference]: Finished difference Result 1230 states and 1330 transitions. [2024-11-17 02:54:11,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-17 02:54:11,059 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.46) internal successors, (123), 50 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 100 [2024-11-17 02:54:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:54:11,062 INFO L225 Difference]: With dead ends: 1230 [2024-11-17 02:54:11,062 INFO L226 Difference]: Without dead ends: 1226 [2024-11-17 02:54:11,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-17 02:54:11,065 INFO L432 NwaCegarLoop]: 1048 mSDtfsCounter, 39 mSDsluCounter, 24038 mSDsCounter, 0 mSdLazyCounter, 1963 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 25086 SdHoareTripleChecker+Invalid, 2013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1963 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:54:11,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 25086 Invalid, 2013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1963 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-17 02:54:11,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2024-11-17 02:54:11,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1224. [2024-11-17 02:54:11,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 799 states have (on average 1.6157697121401753) internal successors, (1291), 1214 states have internal predecessors, (1291), 6 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-11-17 02:54:11,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1304 transitions. [2024-11-17 02:54:11,083 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1304 transitions. Word has length 100 [2024-11-17 02:54:11,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:54:11,083 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1304 transitions. [2024-11-17 02:54:11,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.46) internal successors, (123), 50 states have internal predecessors, (123), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-17 02:54:11,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1304 transitions. [2024-11-17 02:54:11,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-17 02:54:11,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:54:11,085 INFO L215 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:54:11,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 (29)] Forceful destruction successful, exit code 0 [2024-11-17 02:54:11,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-17 02:54:11,289 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr521REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 627 more)] === [2024-11-17 02:54:11,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:54:11,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1268767476, now seen corresponding path program 5 times [2024-11-17 02:54:11,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-17 02:54:11,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274380922] [2024-11-17 02:54:11,290 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 02:54:11,290 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-17 02:54:11,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-17 02:54:11,293 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-17 02:54:11,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2024-11-17 02:54:12,436 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-17 02:54:12,436 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-17 02:54:12,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-17 02:54:12,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:54:12,477 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-17 02:54:12,570 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-17 02:54:12,571 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-17 02:54:12,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:54:12,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-11-17 02:54:13,362 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:54:13,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-17 02:54:13,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-17 02:54:13,424 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2024-11-17 02:54:13,424 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:54:13,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-17 02:54:13,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274380922] [2024-11-17 02:54:13,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274380922] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:54:13,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1373025363] [2024-11-17 02:54:13,721 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-17 02:54:13,721 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-17 02:54:13,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-17 02:54:13,723 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-17 02:54:13,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (31)] Waiting until timeout for monitored process