./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f 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_SAX_test6-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 bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:39:15,558 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:39:15,642 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:39:15,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:39:15,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:39:15,673 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:39:15,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:39:15,674 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:39:15,675 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:39:15,675 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:39:15,676 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:39:15,676 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:39:15,677 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:39:15,678 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:39:15,679 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:39:15,679 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:39:15,679 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:39:15,680 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:39:15,680 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:39:15,680 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:39:15,680 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:39:15,681 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:39:15,681 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:39:15,682 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:39:15,682 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:39:15,682 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:39:15,683 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:39:15,683 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:39:15,683 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:39:15,683 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:39:15,684 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:39:15,684 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:39:15,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:39:15,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:39:15,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:39:15,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:39:15,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:39:15,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:39:15,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:39:15,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:39:15,687 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:39:15,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:39:15,688 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 -> bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 [2024-11-10 17:39:15,927 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:39:15,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:39:15,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:39:15,954 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:39:15,955 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:39:15,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2024-11-10 17:39:17,390 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:39:17,675 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:39:17,677 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2024-11-10 17:39:17,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6e8dfb96/cd081cf366574aabab4de849df6a5c17/FLAG146180dd1 [2024-11-10 17:39:17,720 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f6e8dfb96/cd081cf366574aabab4de849df6a5c17 [2024-11-10 17:39:17,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:39:17,724 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:39:17,726 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:39:17,727 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:39:17,733 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:39:17,733 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:39:17" (1/1) ... [2024-11-10 17:39:17,734 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@765c509f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:39:17, skipping insertion in model container [2024-11-10 17:39:17,736 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:39:17" (1/1) ... [2024-11-10 17:39:17,793 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:39:18,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-10 17:39:18,391 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-10 17:39:18,396 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-10 17:39:18,403 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-10 17:39:18,410 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-10 17:39:18,450 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-10 17:39:18,450 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-10 17:39:18,456 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-10 17:39:18,458 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-10 17:39:18,460 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-10 17:39:18,462 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-10 17:39:18,462 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-10 17:39:18,463 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-10 17:39:18,466 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-10 17:39:18,467 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-10 17:39:18,469 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-10 17:39:18,469 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-10 17:39:18,470 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-10 17:39:18,471 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-10 17:39:18,474 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-10 17:39:18,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:39:18,494 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-10 17:39:18,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2dcc31ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:39:18, skipping insertion in model container [2024-11-10 17:39:18,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:39:18,497 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-10 17:39:18,499 INFO L158 Benchmark]: Toolchain (without parser) took 773.55ms. Allocated memory is still 165.7MB. Free memory was 92.7MB in the beginning and 120.4MB in the end (delta: -27.7MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-11-10 17:39:18,499 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 104.9MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 17:39:18,500 INFO L158 Benchmark]: CACSL2BoogieTranslator took 770.52ms. Allocated memory is still 165.7MB. Free memory was 92.5MB in the beginning and 120.4MB in the end (delta: -27.9MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2024-11-10 17:39:18,501 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.16ms. Allocated memory is still 104.9MB. Free memory is still 68.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 770.52ms. Allocated memory is still 165.7MB. Free memory was 92.5MB in the beginning and 120.4MB in the end (delta: -27.9MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1001]: 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_SAX_test6-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 bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:39:20,506 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:39:20,589 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-10 17:39:20,593 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:39:20,595 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:39:20,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:39:20,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:39:20,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:39:20,627 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:39:20,628 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:39:20,629 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:39:20,629 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:39:20,629 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:39:20,630 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:39:20,632 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:39:20,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:39:20,632 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:39:20,633 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:39:20,633 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:39:20,633 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:39:20,637 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:39:20,638 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:39:20,638 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:39:20,638 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:39:20,638 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:39:20,639 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 17:39:20,639 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:39:20,639 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 17:39:20,640 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:39:20,640 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:39:20,640 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:39:20,640 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:39:20,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:39:20,641 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:39:20,641 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:39:20,641 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:39:20,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:39:20,642 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:39:20,642 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 17:39:20,642 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 17:39:20,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:39:20,644 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:39:20,644 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:39:20,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:39:20,645 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 -> bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 [2024-11-10 17:39:20,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:39:21,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:39:21,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:39:21,005 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:39:21,005 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:39:21,006 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2024-11-10 17:39:22,567 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:39:22,905 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:39:22,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2024-11-10 17:39:22,933 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcf63d743/6ad4b489300d43caa53753d6f5c5dd1c/FLAG7346b985e [2024-11-10 17:39:22,949 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcf63d743/6ad4b489300d43caa53753d6f5c5dd1c [2024-11-10 17:39:22,951 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:39:22,953 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:39:22,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:39:22,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:39:22,961 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:39:22,962 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:39:22" (1/1) ... [2024-11-10 17:39:22,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e8641fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:39:22, skipping insertion in model container [2024-11-10 17:39:22,963 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:39:22" (1/1) ... [2024-11-10 17:39:23,020 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:39:23,555 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-10 17:39:23,612 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-10 17:39:23,614 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-10 17:39:23,617 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-10 17:39:23,623 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-10 17:39:23,668 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-10 17:39:23,669 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-10 17:39:23,671 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-10 17:39:23,672 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-10 17:39:23,676 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-10 17:39:23,678 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-10 17:39:23,682 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-10 17:39:23,683 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-10 17:39:23,686 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-10 17:39:23,690 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-10 17:39:23,692 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-10 17:39:23,695 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-10 17:39:23,696 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-10 17:39:23,697 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-10 17:39:23,704 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-10 17:39:23,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:39:23,728 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-10 17:39:23,744 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:39:23,772 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-10 17:39:23,785 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-10 17:39:23,793 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-10 17:39:23,800 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-10 17:39:23,807 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-10 17:39:23,833 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-10 17:39:23,834 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-10 17:39:23,836 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-10 17:39:23,836 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-10 17:39:23,838 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-10 17:39:23,839 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-10 17:39:23,839 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-10 17:39:23,840 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-10 17:39:23,843 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-10 17:39:23,844 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-10 17:39:23,845 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-10 17:39:23,846 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-10 17:39:23,847 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-10 17:39:23,848 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-10 17:39:23,854 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-10 17:39:23,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:39:23,868 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:39:23,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:39:24,063 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:39:24,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:39:24 WrapperNode [2024-11-10 17:39:24,064 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:39:24,065 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:39:24,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:39:24,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:39:24,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:39:24" (1/1) ... [2024-11-10 17:39:24,112 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:39:24" (1/1) ... [2024-11-10 17:39:24,207 INFO L138 Inliner]: procedures = 286, calls = 353, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1203 [2024-11-10 17:39:24,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:39:24,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:39:24,215 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:39:24,215 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:39:24,226 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:39:24" (1/1) ... [2024-11-10 17:39:24,226 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:39:24" (1/1) ... [2024-11-10 17:39:24,242 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:39:24" (1/1) ... [2024-11-10 17:39:24,359 INFO L175 MemorySlicer]: Split 318 memory accesses to 4 slices as follows [270, 2, 12, 34]. 85 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [0, 2, 10, 0]. The 62 writes are split as follows [57, 0, 1, 4]. [2024-11-10 17:39:24,359 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:39:24" (1/1) ... [2024-11-10 17:39:24,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:39:24" (1/1) ... [2024-11-10 17:39:24,414 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:39:24" (1/1) ... [2024-11-10 17:39:24,416 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:39:24" (1/1) ... [2024-11-10 17:39:24,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:39:24" (1/1) ... [2024-11-10 17:39:24,435 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:39:24" (1/1) ... [2024-11-10 17:39:24,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:39:24,458 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:39:24,458 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:39:24,458 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:39:24,459 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:39:24" (1/1) ... [2024-11-10 17:39:24,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:39:24,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:39:24,492 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-10 17:39:24,498 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-10 17:39:24,539 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-10 17:39:24,540 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-10 17:39:24,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-10 17:39:24,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-10 17:39:24,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-10 17:39:24,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-10 17:39:24,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-10 17:39:24,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-10 17:39:24,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-10 17:39:24,541 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-10 17:39:24,541 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 17:39:24,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 17:39:24,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 17:39:24,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 17:39:24,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-10 17:39:24,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 17:39:24,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-10 17:39:24,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-10 17:39:24,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-10 17:39:24,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-10 17:39:24,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 17:39:24,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-10 17:39:24,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-10 17:39:24,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-10 17:39:24,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-10 17:39:24,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-10 17:39:24,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-10 17:39:24,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-10 17:39:24,546 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-11-10 17:39:24,546 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-11-10 17:39:24,546 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 17:39:24,546 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 17:39:24,546 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 17:39:24,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:39:24,547 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-11-10 17:39:24,547 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-11-10 17:39:24,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 17:39:24,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 17:39:24,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 17:39:24,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-10 17:39:24,548 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-11-10 17:39:24,548 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-11-10 17:39:24,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:39:24,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:39:24,842 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:39:24,844 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:39:24,965 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L955: havoc #t~malloc32.base, #t~malloc32.offset; [2024-11-10 17:39:28,258 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L969: havoc alt_memcmp_#t~nondet36#1; [2024-11-10 17:39:28,258 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: havoc real_malloc_#t~malloc39#1.base, real_malloc_#t~malloc39#1.offset; [2024-11-10 17:39:28,258 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L987: 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-10 17:39:28,382 INFO L? ?]: Removed 1306 outVars from TransFormulas that were not future-live. [2024-11-10 17:39:28,383 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:39:28,425 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:39:28,426 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 17:39:28,426 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:39:28 BoogieIcfgContainer [2024-11-10 17:39:28,426 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:39:28,428 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:39:28,430 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:39:28,433 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:39:28,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:39:22" (1/3) ... [2024-11-10 17:39:28,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3485790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:39:28, skipping insertion in model container [2024-11-10 17:39:28,434 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:39:24" (2/3) ... [2024-11-10 17:39:28,434 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3485790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:39:28, skipping insertion in model container [2024-11-10 17:39:28,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:39:28" (3/3) ... [2024-11-10 17:39:28,437 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test6-2.i [2024-11-10 17:39:28,452 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:39:28,453 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 625 error locations. [2024-11-10 17:39:28,526 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:39:28,533 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;@6e53530a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:39:28,535 INFO L334 AbstractCegarLoop]: Starting to check reachability of 625 error locations. [2024-11-10 17:39:28,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 1315 states, 664 states have (on average 2.161144578313253) internal successors, (1435), 1293 states have internal predecessors, (1435), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 17:39:28,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 17:39:28,545 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:28,546 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 17:39:28,546 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr613REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:39:28,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:28,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1476558, now seen corresponding path program 1 times [2024-11-10 17:39:28,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:39:28,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1465829873] [2024-11-10 17:39:28,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:28,565 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-10 17:39:28,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:39:28,569 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-10 17:39:28,570 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-10 17:39:28,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:28,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:39:28,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:28,855 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-10 17:39:28,865 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-10 17:39:28,865 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:39:28,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:39:28,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1465829873] [2024-11-10 17:39:28,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1465829873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:28,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:28,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:39:28,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130995086] [2024-11-10 17:39:28,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:28,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:39:28,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:39:28,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:39:28,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:39:28,911 INFO L87 Difference]: Start difference. First operand has 1315 states, 664 states have (on average 2.161144578313253) internal successors, (1435), 1293 states have internal predecessors, (1435), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10 17:39:30,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:30,672 INFO L93 Difference]: Finished difference Result 1583 states and 1676 transitions. [2024-11-10 17:39:30,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:39:30,675 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-10 17:39:30,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:30,693 INFO L225 Difference]: With dead ends: 1583 [2024-11-10 17:39:30,693 INFO L226 Difference]: Without dead ends: 1580 [2024-11-10 17:39:30,694 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 17:39:30,697 INFO L432 NwaCegarLoop]: 940 mSDtfsCounter, 939 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 942 SdHoareTripleChecker+Valid, 1299 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:30,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [942 Valid, 1299 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-10 17:39:30,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2024-11-10 17:39:30,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1337. [2024-11-10 17:39:30,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 702 states have (on average 2.02991452991453) internal successors, (1425), 1317 states have internal predecessors, (1425), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 17:39:30,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1459 transitions. [2024-11-10 17:39:30,787 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1459 transitions. Word has length 3 [2024-11-10 17:39:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:30,788 INFO L471 AbstractCegarLoop]: Abstraction has 1337 states and 1459 transitions. [2024-11-10 17:39:30,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10 17:39:30,788 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1459 transitions. [2024-11-10 17:39:30,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 17:39:30,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:30,789 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 17:39:30,806 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-10 17:39:30,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:39:30,993 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr614REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:39:30,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:30,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1476559, now seen corresponding path program 1 times [2024-11-10 17:39:30,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:39:30,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586221236] [2024-11-10 17:39:30,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:30,996 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-10 17:39:30,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:39:30,997 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-10 17:39:30,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 17:39:31,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:31,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:39:31,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:31,154 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-10 17:39:31,169 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-10 17:39:31,169 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:39:31,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:39:31,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586221236] [2024-11-10 17:39:31,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586221236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:31,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:31,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:39:31,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144229382] [2024-11-10 17:39:31,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:31,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:39:31,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:39:31,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:39:31,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:39:31,172 INFO L87 Difference]: Start difference. First operand 1337 states and 1459 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10 17:39:33,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:33,484 INFO L93 Difference]: Finished difference Result 1958 states and 2130 transitions. [2024-11-10 17:39:33,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:39:33,485 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2024-11-10 17:39:33,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:33,491 INFO L225 Difference]: With dead ends: 1958 [2024-11-10 17:39:33,492 INFO L226 Difference]: Without dead ends: 1958 [2024-11-10 17:39:33,492 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-10 17:39:33,493 INFO L432 NwaCegarLoop]: 1078 mSDtfsCounter, 654 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:33,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 1819 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 17:39:33,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2024-11-10 17:39:33,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1563. [2024-11-10 17:39:33,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 927 states have (on average 2.0097087378640777) internal successors, (1863), 1541 states have internal predecessors, (1863), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 17:39:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 1901 transitions. [2024-11-10 17:39:33,523 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 1901 transitions. Word has length 3 [2024-11-10 17:39:33,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:33,523 INFO L471 AbstractCegarLoop]: Abstraction has 1563 states and 1901 transitions. [2024-11-10 17:39:33,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10 17:39:33,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 1901 transitions. [2024-11-10 17:39:33,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 17:39:33,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:33,524 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:39:33,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 17:39:33,725 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-10 17:39:33,725 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr610REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:39:33,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:33,726 INFO L85 PathProgramCache]: Analyzing trace with hash -610856126, now seen corresponding path program 1 times [2024-11-10 17:39:33,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:39:33,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133678515] [2024-11-10 17:39:33,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:33,727 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-10 17:39:33,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:39:33,729 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-10 17:39:33,731 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-10 17:39:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:33,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 17:39:33,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:33,919 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-10 17:39:33,927 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-10 17:39:34,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 17:39:34,006 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-10 17:39:34,034 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 17:39:34,035 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-10 17:39:34,068 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-10 17:39:34,068 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:39:34,069 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:39:34,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133678515] [2024-11-10 17:39:34,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133678515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:34,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:34,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:39:34,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930180774] [2024-11-10 17:39:34,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:34,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:39:34,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:39:34,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:39:34,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:39:34,070 INFO L87 Difference]: Start difference. First operand 1563 states and 1901 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-10 17:39:37,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:37,440 INFO L93 Difference]: Finished difference Result 2679 states and 3098 transitions. [2024-11-10 17:39:37,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:39:37,441 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-10 17:39:37,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:37,450 INFO L225 Difference]: With dead ends: 2679 [2024-11-10 17:39:37,450 INFO L226 Difference]: Without dead ends: 2679 [2024-11-10 17:39:37,451 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-10 17:39:37,451 INFO L432 NwaCegarLoop]: 734 mSDtfsCounter, 2093 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 1427 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2099 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:37,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2099 Valid, 1535 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1427 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-10 17:39:37,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2679 states. [2024-11-10 17:39:37,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2679 to 1717. [2024-11-10 17:39:37,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1717 states, 1081 states have (on average 1.9935245143385754) internal successors, (2155), 1695 states have internal predecessors, (2155), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 17:39:37,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1717 states to 1717 states and 2193 transitions. [2024-11-10 17:39:37,493 INFO L78 Accepts]: Start accepts. Automaton has 1717 states and 2193 transitions. Word has length 9 [2024-11-10 17:39:37,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:37,493 INFO L471 AbstractCegarLoop]: Abstraction has 1717 states and 2193 transitions. [2024-11-10 17:39:37,494 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-10 17:39:37,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1717 states and 2193 transitions. [2024-11-10 17:39:37,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 17:39:37,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:37,495 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:39:37,510 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 (4)] Forceful destruction successful, exit code 0 [2024-11-10 17:39:37,695 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-10 17:39:37,696 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr607REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:39:37,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:37,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1756669350, now seen corresponding path program 1 times [2024-11-10 17:39:37,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:39:37,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317348873] [2024-11-10 17:39:37,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:37,699 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-10 17:39:37,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:39:37,704 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-10 17:39:37,705 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-10 17:39:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:37,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:39:37,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:37,864 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-10 17:39:37,887 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-10 17:39:37,888 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:39:37,888 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:39:37,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317348873] [2024-11-10 17:39:37,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317348873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:37,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:37,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:39:37,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311131203] [2024-11-10 17:39:37,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:37,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:39:37,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:39:37,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:39:37,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:39:37,891 INFO L87 Difference]: Start difference. First operand 1717 states and 2193 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-10 17:39:39,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:39,831 INFO L93 Difference]: Finished difference Result 2289 states and 2993 transitions. [2024-11-10 17:39:39,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:39:39,832 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-10 17:39:39,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:39,839 INFO L225 Difference]: With dead ends: 2289 [2024-11-10 17:39:39,839 INFO L226 Difference]: Without dead ends: 2289 [2024-11-10 17:39:39,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-10 17:39:39,840 INFO L432 NwaCegarLoop]: 1269 mSDtfsCounter, 946 mSDsluCounter, 1349 mSDsCounter, 0 mSdLazyCounter, 1694 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 2618 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:39,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 2618 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1694 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-10 17:39:39,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2024-11-10 17:39:39,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 1672. [2024-11-10 17:39:39,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1081 states have (on average 1.938945420906568) internal successors, (2096), 1650 states have internal predecessors, (2096), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 17:39:39,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2134 transitions. [2024-11-10 17:39:39,867 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2134 transitions. Word has length 10 [2024-11-10 17:39:39,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:39,867 INFO L471 AbstractCegarLoop]: Abstraction has 1672 states and 2134 transitions. [2024-11-10 17:39:39,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-10 17:39:39,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2134 transitions. [2024-11-10 17:39:39,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 17:39:39,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:39,869 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:39:39,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 17:39:40,069 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-10 17:39:40,070 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr608REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:39:40,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:40,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1756669349, now seen corresponding path program 1 times [2024-11-10 17:39:40,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:39:40,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1062969606] [2024-11-10 17:39:40,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:40,071 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-10 17:39:40,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:39:40,074 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-10 17:39:40,075 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-10 17:39:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:40,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 17:39:40,234 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:40,248 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-10 17:39:40,294 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-10 17:39:40,294 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:39:40,295 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:39:40,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1062969606] [2024-11-10 17:39:40,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1062969606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:40,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:40,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:39:40,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314860419] [2024-11-10 17:39:40,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:40,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:39:40,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:39:40,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:39:40,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:39:40,296 INFO L87 Difference]: Start difference. First operand 1672 states and 2134 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-10 17:39:42,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:42,873 INFO L93 Difference]: Finished difference Result 2354 states and 3016 transitions. [2024-11-10 17:39:42,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:39:42,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-10 17:39:42,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:42,880 INFO L225 Difference]: With dead ends: 2354 [2024-11-10 17:39:42,880 INFO L226 Difference]: Without dead ends: 2354 [2024-11-10 17:39:42,880 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-10 17:39:42,881 INFO L432 NwaCegarLoop]: 1446 mSDtfsCounter, 723 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 1676 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 2983 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:42,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 2983 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1676 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-10 17:39:42,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2354 states. [2024-11-10 17:39:42,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2354 to 1664. [2024-11-10 17:39:42,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1664 states, 1083 states have (on average 1.915050784856879) internal successors, (2074), 1642 states have internal predecessors, (2074), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-10 17:39:42,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2112 transitions. [2024-11-10 17:39:42,909 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2112 transitions. Word has length 10 [2024-11-10 17:39:42,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:42,910 INFO L471 AbstractCegarLoop]: Abstraction has 1664 states and 2112 transitions. [2024-11-10 17:39:42,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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-10 17:39:42,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2112 transitions. [2024-11-10 17:39:42,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 17:39:42,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:42,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:39:42,916 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 (6)] Forceful destruction successful, exit code 0 [2024-11-10 17:39:43,114 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-10 17:39:43,115 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:39:43,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:43,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1224117696, now seen corresponding path program 1 times [2024-11-10 17:39:43,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:39:43,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [805692035] [2024-11-10 17:39:43,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:43,116 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-10 17:39:43,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:39:43,117 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-10 17:39:43,118 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-10 17:39:43,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:43,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 17:39:43,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:43,364 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-10 17:39:43,365 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:39:43,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:39:43,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [805692035] [2024-11-10 17:39:43,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [805692035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:43,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:43,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:39:43,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283679097] [2024-11-10 17:39:43,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:43,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:39:43,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:39:43,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:39:43,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:39:43,368 INFO L87 Difference]: Start difference. First operand 1664 states and 2112 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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-10 17:39:44,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:44,093 INFO L93 Difference]: Finished difference Result 2306 states and 2899 transitions. [2024-11-10 17:39:44,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:39:44,094 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), 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 16 [2024-11-10 17:39:44,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:44,106 INFO L225 Difference]: With dead ends: 2306 [2024-11-10 17:39:44,107 INFO L226 Difference]: Without dead ends: 2306 [2024-11-10 17:39:44,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:39:44,108 INFO L432 NwaCegarLoop]: 1489 mSDtfsCounter, 655 mSDsluCounter, 2561 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 4050 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:44,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 4050 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 17:39:44,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2024-11-10 17:39:44,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 1936. [2024-11-10 17:39:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1936 states, 1352 states have (on average 1.9230769230769231) internal successors, (2600), 1911 states have internal predecessors, (2600), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 17:39:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 2644 transitions. [2024-11-10 17:39:44,145 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 2644 transitions. Word has length 16 [2024-11-10 17:39:44,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:44,145 INFO L471 AbstractCegarLoop]: Abstraction has 1936 states and 2644 transitions. [2024-11-10 17:39:44,146 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), 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-10 17:39:44,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 2644 transitions. [2024-11-10 17:39:44,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 17:39:44,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:44,147 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:39:44,152 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-10 17:39:44,347 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-10 17:39:44,348 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr291REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:39:44,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:44,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1224364623, now seen corresponding path program 1 times [2024-11-10 17:39:44,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:39:44,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1232030572] [2024-11-10 17:39:44,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:44,349 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-10 17:39:44,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:39:44,350 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-10 17:39:44,351 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-10 17:39:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:44,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:39:44,500 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:44,507 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-10 17:39:44,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:39:44,507 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:39:44,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1232030572] [2024-11-10 17:39:44,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1232030572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:44,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:44,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:39:44,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310133547] [2024-11-10 17:39:44,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:44,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:39:44,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:39:44,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:39:44,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:39:44,509 INFO L87 Difference]: Start difference. First operand 1936 states and 2644 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:39:44,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:44,541 INFO L93 Difference]: Finished difference Result 1840 states and 2472 transitions. [2024-11-10 17:39:44,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:39:44,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-10 17:39:44,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:44,548 INFO L225 Difference]: With dead ends: 1840 [2024-11-10 17:39:44,548 INFO L226 Difference]: Without dead ends: 1840 [2024-11-10 17:39:44,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-10 17:39:44,551 INFO L432 NwaCegarLoop]: 1259 mSDtfsCounter, 71 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2454 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-10 17:39:44,552 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2454 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:39:44,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2024-11-10 17:39:44,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1840. [2024-11-10 17:39:44,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1280 states have (on average 1.896875) internal successors, (2428), 1815 states have internal predecessors, (2428), 24 states have call successors, (24), 5 states have call predecessors, (24), 4 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-11-10 17:39:44,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2472 transitions. [2024-11-10 17:39:44,581 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2472 transitions. Word has length 16 [2024-11-10 17:39:44,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:44,581 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2472 transitions. [2024-11-10 17:39:44,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:39:44,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2472 transitions. [2024-11-10 17:39:44,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-10 17:39:44,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:44,582 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-10 17:39:44,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-10 17:39:44,783 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-10 17:39:44,783 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:39:44,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:44,784 INFO L85 PathProgramCache]: Analyzing trace with hash -429465059, now seen corresponding path program 1 times [2024-11-10 17:39:44,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:39:44,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906704228] [2024-11-10 17:39:44,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:44,784 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-10 17:39:44,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:39:44,786 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-10 17:39:44,786 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-10 17:39:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:44,977 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 17:39:44,979 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:44,985 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 17:39:44,986 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 17:39:44,986 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 17:39:44,997 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-10 17:39:45,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 17:39:45,063 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-10 17:39:45,075 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-10 17:39:45,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:39:45,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:39:45,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906704228] [2024-11-10 17:39:45,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906704228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:45,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:45,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:39:45,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228219709] [2024-11-10 17:39:45,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:45,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:39:45,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:39:45,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:39:45,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:39:45,079 INFO L87 Difference]: Start difference. First operand 1840 states and 2472 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:39:45,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:45,438 INFO L93 Difference]: Finished difference Result 2573 states and 3007 transitions. [2024-11-10 17:39:45,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:39:45,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-10 17:39:45,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:45,445 INFO L225 Difference]: With dead ends: 2573 [2024-11-10 17:39:45,445 INFO L226 Difference]: Without dead ends: 2573 [2024-11-10 17:39:45,446 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-10 17:39:45,446 INFO L432 NwaCegarLoop]: 1454 mSDtfsCounter, 1132 mSDsluCounter, 2672 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 4126 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:45,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 4126 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 17:39:45,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2024-11-10 17:39:45,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 1488. [2024-11-10 17:39:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1488 states, 930 states have (on average 1.8903225806451613) internal successors, (1758), 1465 states have internal predecessors, (1758), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 17:39:45,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 1798 transitions. [2024-11-10 17:39:45,472 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 1798 transitions. Word has length 19 [2024-11-10 17:39:45,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:45,472 INFO L471 AbstractCegarLoop]: Abstraction has 1488 states and 1798 transitions. [2024-11-10 17:39:45,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:39:45,472 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 1798 transitions. [2024-11-10 17:39:45,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-10 17:39:45,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:45,472 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-10 17:39:45,479 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-10 17:39:45,673 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-10 17:39:45,673 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr599REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:39:45,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:45,674 INFO L85 PathProgramCache]: Analyzing trace with hash 175635572, now seen corresponding path program 1 times [2024-11-10 17:39:45,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:39:45,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863910752] [2024-11-10 17:39:45,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:45,675 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-10 17:39:45,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:39:45,680 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-10 17:39:45,681 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-10 17:39:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:45,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 17:39:45,862 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:45,869 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-10 17:39:45,869 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:39:45,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:39:45,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863910752] [2024-11-10 17:39:45,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863910752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:45,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:45,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:39:45,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919242432] [2024-11-10 17:39:45,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:45,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:39:45,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:39:45,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:39:45,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:39:45,870 INFO L87 Difference]: Start difference. First operand 1488 states and 1798 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-10 17:39:45,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:45,905 INFO L93 Difference]: Finished difference Result 1428 states and 1712 transitions. [2024-11-10 17:39:45,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:39:45,906 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-10 17:39:45,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:45,910 INFO L225 Difference]: With dead ends: 1428 [2024-11-10 17:39:45,910 INFO L226 Difference]: Without dead ends: 1428 [2024-11-10 17:39:45,910 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-10 17:39:45,910 INFO L432 NwaCegarLoop]: 1216 mSDtfsCounter, 71 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2368 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-10 17:39:45,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2368 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:39:45,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2024-11-10 17:39:45,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2024-11-10 17:39:45,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1428 states, 894 states have (on average 1.8702460850111857) internal successors, (1672), 1405 states have internal predecessors, (1672), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 17:39:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1712 transitions. [2024-11-10 17:39:45,928 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1712 transitions. Word has length 21 [2024-11-10 17:39:45,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:45,929 INFO L471 AbstractCegarLoop]: Abstraction has 1428 states and 1712 transitions. [2024-11-10 17:39:45,929 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-10 17:39:45,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1712 transitions. [2024-11-10 17:39:45,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-10 17:39:45,930 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:45,930 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-10 17:39:45,938 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-10 17:39:46,130 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-10 17:39:46,131 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr575REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:39:46,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:46,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1282032712, now seen corresponding path program 1 times [2024-11-10 17:39:46,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:39:46,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278026529] [2024-11-10 17:39:46,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:46,133 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-10 17:39:46,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:39:46,136 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-10 17:39:46,137 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-10 17:39:46,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:46,336 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:39:46,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:46,356 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-10 17:39:46,356 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:39:46,356 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:39:46,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278026529] [2024-11-10 17:39:46,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278026529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:46,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:46,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:39:46,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900008691] [2024-11-10 17:39:46,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:46,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:39:46,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:39:46,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:39:46,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:39:46,358 INFO L87 Difference]: Start difference. First operand 1428 states and 1712 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-10 17:39:46,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:46,408 INFO L93 Difference]: Finished difference Result 1398 states and 1654 transitions. [2024-11-10 17:39:46,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:39:46,409 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-10 17:39:46,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:46,413 INFO L225 Difference]: With dead ends: 1398 [2024-11-10 17:39:46,413 INFO L226 Difference]: Without dead ends: 1398 [2024-11-10 17:39:46,413 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-10 17:39:46,414 INFO L432 NwaCegarLoop]: 1171 mSDtfsCounter, 48 mSDsluCounter, 2315 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 3486 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-10 17:39:46,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 3486 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:39:46,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2024-11-10 17:39:46,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1398. [2024-11-10 17:39:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1398 states, 878 states have (on average 1.8382687927107062) internal successors, (1614), 1375 states have internal predecessors, (1614), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 17:39:46,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1398 states to 1398 states and 1654 transitions. [2024-11-10 17:39:46,433 INFO L78 Accepts]: Start accepts. Automaton has 1398 states and 1654 transitions. Word has length 23 [2024-11-10 17:39:46,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:46,433 INFO L471 AbstractCegarLoop]: Abstraction has 1398 states and 1654 transitions. [2024-11-10 17:39:46,434 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-10 17:39:46,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1398 states and 1654 transitions. [2024-11-10 17:39:46,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 17:39:46,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:46,435 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-10 17:39:46,442 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-10 17:39:46,635 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-10 17:39:46,635 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr561REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:39:46,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:46,636 INFO L85 PathProgramCache]: Analyzing trace with hash 328806238, now seen corresponding path program 1 times [2024-11-10 17:39:46,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:39:46,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648143979] [2024-11-10 17:39:46,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:46,637 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-10 17:39:46,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:39:46,640 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-10 17:39:46,642 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-10 17:39:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:46,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 17:39:46,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:46,889 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-10 17:39:46,996 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-10 17:39:46,996 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:39:46,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:39:46,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648143979] [2024-11-10 17:39:46,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [648143979] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:46,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:46,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:39:46,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167461573] [2024-11-10 17:39:46,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:46,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:39:46,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:39:46,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:39:46,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:39:46,998 INFO L87 Difference]: Start difference. First operand 1398 states and 1654 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 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-10 17:39:49,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:49,010 INFO L93 Difference]: Finished difference Result 1839 states and 2216 transitions. [2024-11-10 17:39:49,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:39:49,011 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 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-10 17:39:49,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:49,015 INFO L225 Difference]: With dead ends: 1839 [2024-11-10 17:39:49,015 INFO L226 Difference]: Without dead ends: 1839 [2024-11-10 17:39:49,016 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:39:49,016 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 836 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 1891 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 2391 SdHoareTripleChecker+Invalid, 1899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:49,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 2391 Invalid, 1899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1891 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-10 17:39:49,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2024-11-10 17:39:49,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1394. [2024-11-10 17:39:49,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 878 states have (on average 1.8291571753986333) internal successors, (1606), 1371 states have internal predecessors, (1606), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 17:39:49,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1646 transitions. [2024-11-10 17:39:49,034 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1646 transitions. Word has length 37 [2024-11-10 17:39:49,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:49,034 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1646 transitions. [2024-11-10 17:39:49,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 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-10 17:39:49,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1646 transitions. [2024-11-10 17:39:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 17:39:49,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:49,035 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-10 17:39:49,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-10 17:39:49,235 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-10 17:39:49,236 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr562REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:39:49,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:49,236 INFO L85 PathProgramCache]: Analyzing trace with hash 328806239, now seen corresponding path program 1 times [2024-11-10 17:39:49,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:39:49,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1554994207] [2024-11-10 17:39:49,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:49,237 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-10 17:39:49,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:39:49,238 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-10 17:39:49,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 (13)] Waiting until timeout for monitored process [2024-11-10 17:39:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:49,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 17:39:49,445 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:49,470 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-10 17:39:49,635 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-10 17:39:49,636 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:39:49,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:39:49,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1554994207] [2024-11-10 17:39:49,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1554994207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:49,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:49,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:39:49,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35398873] [2024-11-10 17:39:49,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:49,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:39:49,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:39:49,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:39:49,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:39:49,637 INFO L87 Difference]: Start difference. First operand 1394 states and 1646 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 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-10 17:39:52,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:52,330 INFO L93 Difference]: Finished difference Result 1965 states and 2344 transitions. [2024-11-10 17:39:52,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:39:52,331 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 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-10 17:39:52,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:52,336 INFO L225 Difference]: With dead ends: 1965 [2024-11-10 17:39:52,336 INFO L226 Difference]: Without dead ends: 1965 [2024-11-10 17:39:52,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:39:52,337 INFO L432 NwaCegarLoop]: 1432 mSDtfsCounter, 609 mSDsluCounter, 2383 mSDsCounter, 0 mSdLazyCounter, 2295 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 3815 SdHoareTripleChecker+Invalid, 2299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:52,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 3815 Invalid, 2299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2295 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-10 17:39:52,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1965 states. [2024-11-10 17:39:52,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1965 to 1390. [2024-11-10 17:39:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 878 states have (on average 1.8200455580865604) internal successors, (1598), 1367 states have internal predecessors, (1598), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 17:39:52,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1638 transitions. [2024-11-10 17:39:52,352 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1638 transitions. Word has length 37 [2024-11-10 17:39:52,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:52,353 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 1638 transitions. [2024-11-10 17:39:52,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 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-10 17:39:52,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1638 transitions. [2024-11-10 17:39:52,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-10 17:39:52,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:52,354 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] [2024-11-10 17:39:52,364 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-10 17:39:52,554 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-10 17:39:52,555 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:39:52,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:52,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1735593719, now seen corresponding path program 1 times [2024-11-10 17:39:52,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:39:52,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251990480] [2024-11-10 17:39:52,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:52,556 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-10 17:39:52,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:39:52,557 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-10 17:39:52,558 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-10 17:39:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:52,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 17:39:52,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:52,831 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-10 17:39:52,831 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:39:52,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:39:52,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251990480] [2024-11-10 17:39:52,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1251990480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:52,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:52,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:39:52,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881507346] [2024-11-10 17:39:52,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:52,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:39:52,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:39:52,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:39:52,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:39:52,851 INFO L87 Difference]: Start difference. First operand 1390 states and 1638 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-10 17:39:52,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:52,901 INFO L93 Difference]: Finished difference Result 1378 states and 1618 transitions. [2024-11-10 17:39:52,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:39:52,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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 59 [2024-11-10 17:39:52,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:52,905 INFO L225 Difference]: With dead ends: 1378 [2024-11-10 17:39:52,905 INFO L226 Difference]: Without dead ends: 1378 [2024-11-10 17:39:52,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 56 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-10 17:39:52,906 INFO L432 NwaCegarLoop]: 1165 mSDtfsCounter, 21 mSDsluCounter, 2298 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3463 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-10 17:39:52,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3463 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:39:52,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2024-11-10 17:39:52,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1378. [2024-11-10 17:39:52,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 866 states have (on average 1.8221709006928406) internal successors, (1578), 1355 states have internal predecessors, (1578), 22 states have call successors, (22), 5 states have call predecessors, (22), 4 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 17:39:52,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1618 transitions. [2024-11-10 17:39:52,921 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1618 transitions. Word has length 59 [2024-11-10 17:39:52,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:52,921 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 1618 transitions. [2024-11-10 17:39:52,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-10 17:39:52,921 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1618 transitions. [2024-11-10 17:39:52,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 17:39:52,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:52,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:39:52,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-10 17:39:53,124 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-10 17:39:53,125 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:39:53,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:53,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1413574463, now seen corresponding path program 1 times [2024-11-10 17:39:53,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:39:53,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505471788] [2024-11-10 17:39:53,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:53,126 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-10 17:39:53,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:39:53,127 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-10 17:39:53,128 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-10 17:39:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:53,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 17:39:53,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:53,491 INFO L349 Elim1Store]: treesize reduction 15, result has 42.3 percent of original size [2024-11-10 17:39:53,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2024-11-10 17:39:53,566 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-10 17:39:53,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2024-11-10 17:39:53,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:39:53,951 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:39:53,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:39:53,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1505471788] [2024-11-10 17:39:53,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1505471788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:53,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:53,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:39:53,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166348142] [2024-11-10 17:39:53,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:53,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:39:53,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:39:53,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:39:53,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:39:53,953 INFO L87 Difference]: Start difference. First operand 1378 states and 1618 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-10 17:39:57,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:57,051 INFO L93 Difference]: Finished difference Result 2522 states and 2958 transitions. [2024-11-10 17:39:57,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:39:57,052 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 67 [2024-11-10 17:39:57,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:57,057 INFO L225 Difference]: With dead ends: 2522 [2024-11-10 17:39:57,057 INFO L226 Difference]: Without dead ends: 2522 [2024-11-10 17:39:57,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:39:57,058 INFO L432 NwaCegarLoop]: 925 mSDtfsCounter, 1016 mSDsluCounter, 2727 mSDsCounter, 0 mSdLazyCounter, 2669 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1016 SdHoareTripleChecker+Valid, 3652 SdHoareTripleChecker+Invalid, 2673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:57,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1016 Valid, 3652 Invalid, 2673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2669 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-10 17:39:57,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2024-11-10 17:39:57,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 1850. [2024-11-10 17:39:57,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1850 states, 1322 states have (on average 1.8055975794251136) internal successors, (2387), 1814 states have internal predecessors, (2387), 35 states have call successors, (35), 9 states have call predecessors, (35), 7 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-10 17:39:57,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1850 states to 1850 states and 2453 transitions. [2024-11-10 17:39:57,080 INFO L78 Accepts]: Start accepts. Automaton has 1850 states and 2453 transitions. Word has length 67 [2024-11-10 17:39:57,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:57,081 INFO L471 AbstractCegarLoop]: Abstraction has 1850 states and 2453 transitions. [2024-11-10 17:39:57,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-10 17:39:57,081 INFO L276 IsEmpty]: Start isEmpty. Operand 1850 states and 2453 transitions. [2024-11-10 17:39:57,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-10 17:39:57,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:57,082 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:39:57,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-10 17:39:57,282 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-10 17:39:57,283 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:39:57,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:57,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1413574464, now seen corresponding path program 1 times [2024-11-10 17:39:57,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:39:57,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893627390] [2024-11-10 17:39:57,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:57,284 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-10 17:39:57,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:39:57,285 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-10 17:39:57,286 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-10 17:39:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:57,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 17:39:57,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:57,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 17:39:57,702 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-10 17:39:57,790 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 17:39:57,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-10 17:39:58,309 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-10 17:39:58,310 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:39:58,310 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:39:58,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893627390] [2024-11-10 17:39:58,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893627390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:58,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:58,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:39:58,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521911395] [2024-11-10 17:39:58,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:58,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:39:58,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:39:58,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:39:58,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:39:58,313 INFO L87 Difference]: Start difference. First operand 1850 states and 2453 transitions. Second operand has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-10 17:40:00,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:00,604 INFO L93 Difference]: Finished difference Result 1856 states and 2460 transitions. [2024-11-10 17:40:00,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:40:00,605 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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 67 [2024-11-10 17:40:00,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:00,609 INFO L225 Difference]: With dead ends: 1856 [2024-11-10 17:40:00,609 INFO L226 Difference]: Without dead ends: 1856 [2024-11-10 17:40:00,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:40:00,610 INFO L432 NwaCegarLoop]: 1160 mSDtfsCounter, 62 mSDsluCounter, 1904 mSDsCounter, 0 mSdLazyCounter, 1657 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 3064 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:00,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 3064 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1657 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-10 17:40:00,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2024-11-10 17:40:00,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1856. [2024-11-10 17:40:00,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1856 states, 1327 states have (on average 1.8025621703089676) internal successors, (2392), 1819 states have internal predecessors, (2392), 36 states have call successors, (36), 10 states have call predecessors, (36), 7 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 17:40:00,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1856 states to 1856 states and 2460 transitions. [2024-11-10 17:40:00,630 INFO L78 Accepts]: Start accepts. Automaton has 1856 states and 2460 transitions. Word has length 67 [2024-11-10 17:40:00,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:00,630 INFO L471 AbstractCegarLoop]: Abstraction has 1856 states and 2460 transitions. [2024-11-10 17:40:00,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 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-10 17:40:00,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2460 transitions. [2024-11-10 17:40:00,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 17:40:00,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:00,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:40:00,643 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-10 17:40:00,832 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-10 17:40:00,832 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:40:00,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:00,833 INFO L85 PathProgramCache]: Analyzing trace with hash -481187710, now seen corresponding path program 1 times [2024-11-10 17:40:00,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:40:00,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273402130] [2024-11-10 17:40:00,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:00,833 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-10 17:40:00,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:40:00,834 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-10 17:40:00,842 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-10 17:40:01,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:01,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 17:40:01,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:40:01,124 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-10 17:40:01,124 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:40:01,124 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:40:01,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273402130] [2024-11-10 17:40:01,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273402130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:40:01,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:40:01,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:40:01,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894180217] [2024-11-10 17:40:01,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:40:01,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:40:01,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:40:01,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:40:01,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:40:01,126 INFO L87 Difference]: Start difference. First operand 1856 states and 2460 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:40:01,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:01,186 INFO L93 Difference]: Finished difference Result 1882 states and 2487 transitions. [2024-11-10 17:40:01,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:40:01,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 75 [2024-11-10 17:40:01,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:01,190 INFO L225 Difference]: With dead ends: 1882 [2024-11-10 17:40:01,190 INFO L226 Difference]: Without dead ends: 1882 [2024-11-10 17:40:01,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-10 17:40:01,191 INFO L432 NwaCegarLoop]: 1175 mSDtfsCounter, 15 mSDsluCounter, 4695 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 5870 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:01,191 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 5870 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:40:01,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2024-11-10 17:40:01,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1880. [2024-11-10 17:40:01,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1345 states have (on average 1.795539033457249) internal successors, (2415), 1839 states have internal predecessors, (2415), 38 states have call successors, (38), 14 states have call predecessors, (38), 11 states have return successors, (34), 30 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-10 17:40:01,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2487 transitions. [2024-11-10 17:40:01,216 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2487 transitions. Word has length 75 [2024-11-10 17:40:01,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:01,216 INFO L471 AbstractCegarLoop]: Abstraction has 1880 states and 2487 transitions. [2024-11-10 17:40:01,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:40:01,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2487 transitions. [2024-11-10 17:40:01,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 17:40:01,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:01,217 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] [2024-11-10 17:40:01,227 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-10 17:40:01,417 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-10 17:40:01,418 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr517REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:40:01,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:01,419 INFO L85 PathProgramCache]: Analyzing trace with hash 344424323, now seen corresponding path program 1 times [2024-11-10 17:40:01,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:40:01,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1368116706] [2024-11-10 17:40:01,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:01,419 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-10 17:40:01,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:40:01,422 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-10 17:40:01,423 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-10 17:40:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:01,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:40:01,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:40:01,819 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-10 17:40:01,819 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:40:01,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:40:01,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1368116706] [2024-11-10 17:40:01,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1368116706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:40:01,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:40:01,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 17:40:01,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358885995] [2024-11-10 17:40:01,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:40:01,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:40:01,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:40:01,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:40:01,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:40:01,822 INFO L87 Difference]: Start difference. First operand 1880 states and 2487 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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-10 17:40:02,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:02,053 INFO L93 Difference]: Finished difference Result 1892 states and 2501 transitions. [2024-11-10 17:40:02,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 17:40:02,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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 73 [2024-11-10 17:40:02,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:02,063 INFO L225 Difference]: With dead ends: 1892 [2024-11-10 17:40:02,063 INFO L226 Difference]: Without dead ends: 1892 [2024-11-10 17:40:02,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:40:02,063 INFO L432 NwaCegarLoop]: 1158 mSDtfsCounter, 23 mSDsluCounter, 4532 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 5690 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:02,064 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 5690 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 17:40:02,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1892 states. [2024-11-10 17:40:02,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1892 to 1883. [2024-11-10 17:40:02,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1883 states, 1347 states have (on average 1.7943578322197475) internal successors, (2417), 1841 states have internal predecessors, (2417), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-10 17:40:02,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 2490 transitions. [2024-11-10 17:40:02,107 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 2490 transitions. Word has length 73 [2024-11-10 17:40:02,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:02,107 INFO L471 AbstractCegarLoop]: Abstraction has 1883 states and 2490 transitions. [2024-11-10 17:40:02,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 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-10 17:40:02,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 2490 transitions. [2024-11-10 17:40:02,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 17:40:02,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:02,108 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-10 17:40:02,117 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-10 17:40:02,308 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-10 17:40:02,309 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr517REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:40:02,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:02,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1635836253, now seen corresponding path program 1 times [2024-11-10 17:40:02,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:40:02,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120883422] [2024-11-10 17:40:02,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:02,311 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-10 17:40:02,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:40:02,314 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-10 17:40:02,315 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-10 17:40:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:02,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 17:40:02,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:40:02,716 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-10 17:40:02,824 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (= (store |c_old(#valid)| |alt_malloc_#res.base| (_ bv1 1)) |c_#valid|)) is different from true [2024-11-10 17:40:02,840 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-10 17:40:02,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-10 17:40:02,850 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-10 17:40:02,850 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:40:02,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:40:02,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120883422] [2024-11-10 17:40:02,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [120883422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:40:02,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:40:02,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 17:40:02,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855287428] [2024-11-10 17:40:02,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:40:02,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:40:02,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:40:02,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:40:02,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2024-11-10 17:40:02,871 INFO L87 Difference]: Start difference. First operand 1883 states and 2490 transitions. Second operand has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 17:40:05,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:05,034 INFO L93 Difference]: Finished difference Result 2319 states and 3050 transitions. [2024-11-10 17:40:05,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 17:40:05,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 78 [2024-11-10 17:40:05,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:05,038 INFO L225 Difference]: With dead ends: 2319 [2024-11-10 17:40:05,038 INFO L226 Difference]: Without dead ends: 2319 [2024-11-10 17:40:05,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2024-11-10 17:40:05,039 INFO L432 NwaCegarLoop]: 738 mSDtfsCounter, 792 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 795 SdHoareTripleChecker+Valid, 2284 SdHoareTripleChecker+Invalid, 3538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1581 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:05,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [795 Valid, 2284 Invalid, 3538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1934 Invalid, 0 Unknown, 1581 Unchecked, 2.1s Time] [2024-11-10 17:40:05,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2024-11-10 17:40:05,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 1882. [2024-11-10 17:40:05,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1347 states have (on average 1.7928730512249442) internal successors, (2415), 1840 states have internal predecessors, (2415), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-10 17:40:05,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2488 transitions. [2024-11-10 17:40:05,062 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2488 transitions. Word has length 78 [2024-11-10 17:40:05,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:05,062 INFO L471 AbstractCegarLoop]: Abstraction has 1882 states and 2488 transitions. [2024-11-10 17:40:05,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.8) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 17:40:05,062 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2488 transitions. [2024-11-10 17:40:05,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-10 17:40:05,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:05,063 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-10 17:40:05,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-10 17:40:05,263 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-10 17:40:05,264 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr518REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:40:05,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:05,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1635836252, now seen corresponding path program 1 times [2024-11-10 17:40:05,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:40:05,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440191248] [2024-11-10 17:40:05,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:05,265 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-10 17:40:05,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:40:05,266 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-10 17:40:05,267 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-10 17:40:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:05,639 INFO L255 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 17:40:05,642 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:40:05,651 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-10 17:40:05,655 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-10 17:40:06,028 WARN L873 $PredicateComparison]: unable to prove that (exists ((|alt_malloc_#res.base| (_ BitVec 32))) (and (= (store |c_old(#length)| |alt_malloc_#res.base| (select |c_#length| |alt_malloc_#res.base|)) |c_#length|) (= (_ bv0 1) (select |c_old(#valid)| |alt_malloc_#res.base|)))) is different from true [2024-11-10 17:40:06,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 17:40:06,040 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-10 17:40:06,049 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-10 17:40:06,050 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-10 17:40:06,060 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-10 17:40:06,060 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:40:06,061 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:40:06,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440191248] [2024-11-10 17:40:06,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440191248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:40:06,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:40:06,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:40:06,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534530094] [2024-11-10 17:40:06,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:40:06,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:40:06,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:40:06,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:40:06,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2024-11-10 17:40:06,063 INFO L87 Difference]: Start difference. First operand 1882 states and 2488 transitions. Second operand has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 17:40:10,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:10,478 INFO L93 Difference]: Finished difference Result 3022 states and 3986 transitions. [2024-11-10 17:40:10,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 17:40:10,479 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 78 [2024-11-10 17:40:10,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:10,484 INFO L225 Difference]: With dead ends: 3022 [2024-11-10 17:40:10,484 INFO L226 Difference]: Without dead ends: 3022 [2024-11-10 17:40:10,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2024-11-10 17:40:10,485 INFO L432 NwaCegarLoop]: 1248 mSDtfsCounter, 975 mSDsluCounter, 2056 mSDsCounter, 0 mSdLazyCounter, 4127 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 3304 SdHoareTripleChecker+Invalid, 6233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 4127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2079 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:10,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 3304 Invalid, 6233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 4127 Invalid, 0 Unknown, 2079 Unchecked, 4.3s Time] [2024-11-10 17:40:10,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3022 states. [2024-11-10 17:40:10,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3022 to 1874. [2024-11-10 17:40:10,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1874 states, 1347 states have (on average 1.7809948032665182) internal successors, (2399), 1832 states have internal predecessors, (2399), 38 states have call successors, (38), 14 states have call predecessors, (38), 12 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-10 17:40:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1874 states to 1874 states and 2472 transitions. [2024-11-10 17:40:10,513 INFO L78 Accepts]: Start accepts. Automaton has 1874 states and 2472 transitions. Word has length 78 [2024-11-10 17:40:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:10,514 INFO L471 AbstractCegarLoop]: Abstraction has 1874 states and 2472 transitions. [2024-11-10 17:40:10,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.333333333333334) internal successors, (74), 6 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 17:40:10,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1874 states and 2472 transitions. [2024-11-10 17:40:10,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-10 17:40:10,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:10,515 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, 1, 1, 1, 1, 1, 1] [2024-11-10 17:40:10,528 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-10 17:40:10,715 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-10 17:40:10,716 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting alt_bzeroErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:40:10,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:10,716 INFO L85 PathProgramCache]: Analyzing trace with hash -276349187, now seen corresponding path program 1 times [2024-11-10 17:40:10,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:40:10,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406981320] [2024-11-10 17:40:10,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:10,717 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-10 17:40:10,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:40:10,718 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-10 17:40:10,719 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-10 17:40:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:11,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 17:40:11,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:40:11,024 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-10 17:40:11,040 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-10 17:40:11,057 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-10 17:40:11,089 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-10 17:40:11,089 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:40:11,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:40:11,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406981320] [2024-11-10 17:40:11,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406981320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:40:11,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:40:11,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 17:40:11,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46224373] [2024-11-10 17:40:11,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:40:11,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 17:40:11,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:40:11,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 17:40:11,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 17:40:11,091 INFO L87 Difference]: Start difference. First operand 1874 states and 2472 transitions. Second operand has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:40:13,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:13,854 INFO L93 Difference]: Finished difference Result 1891 states and 2490 transitions. [2024-11-10 17:40:13,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 17:40:13,854 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 85 [2024-11-10 17:40:13,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:13,857 INFO L225 Difference]: With dead ends: 1891 [2024-11-10 17:40:13,857 INFO L226 Difference]: Without dead ends: 1891 [2024-11-10 17:40:13,858 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 17:40:13,859 INFO L432 NwaCegarLoop]: 1161 mSDtfsCounter, 19 mSDsluCounter, 3888 mSDsCounter, 0 mSdLazyCounter, 3139 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 5049 SdHoareTripleChecker+Invalid, 3141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:13,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 5049 Invalid, 3141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3139 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-10 17:40:13,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2024-11-10 17:40:13,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1890. [2024-11-10 17:40:13,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1361 states have (on average 1.7759000734753858) internal successors, (2417), 1846 states have internal predecessors, (2417), 38 states have call successors, (38), 16 states have call predecessors, (38), 14 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-10 17:40:13,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2490 transitions. [2024-11-10 17:40:13,887 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2490 transitions. Word has length 85 [2024-11-10 17:40:13,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:13,887 INFO L471 AbstractCegarLoop]: Abstraction has 1890 states and 2490 transitions. [2024-11-10 17:40:13,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:40:13,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2490 transitions. [2024-11-10 17:40:13,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-10 17:40:13,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:13,888 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:40:13,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Ended with exit code 0 [2024-11-10 17:40:14,089 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-10 17:40:14,090 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting alt_bzeroErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:40:14,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:14,091 INFO L85 PathProgramCache]: Analyzing trace with hash 23109801, now seen corresponding path program 1 times [2024-11-10 17:40:14,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:40:14,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378565336] [2024-11-10 17:40:14,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:14,092 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-10 17:40:14,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:40:14,095 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-10 17:40:14,096 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-10 17:40:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:14,467 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 17:40:14,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:40:14,486 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:40:14,517 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-10 17:40:14,523 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-10 17:40:14,555 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-10 17:40:14,611 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-10 17:40:14,611 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:40:14,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:40:14,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378565336] [2024-11-10 17:40:14,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378565336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:40:14,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:40:14,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 17:40:14,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586720257] [2024-11-10 17:40:14,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:40:14,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 17:40:14,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:40:14,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 17:40:14,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 17:40:14,613 INFO L87 Difference]: Start difference. First operand 1890 states and 2490 transitions. Second operand has 9 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 17:40:18,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:18,418 INFO L93 Difference]: Finished difference Result 1890 states and 2488 transitions. [2024-11-10 17:40:18,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 17:40:18,418 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2024-11-10 17:40:18,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:18,421 INFO L225 Difference]: With dead ends: 1890 [2024-11-10 17:40:18,422 INFO L226 Difference]: Without dead ends: 1890 [2024-11-10 17:40:18,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-10 17:40:18,422 INFO L432 NwaCegarLoop]: 1157 mSDtfsCounter, 15 mSDsluCounter, 4913 mSDsCounter, 0 mSdLazyCounter, 3287 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 6070 SdHoareTripleChecker+Invalid, 3288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:18,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 6070 Invalid, 3288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3287 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-10 17:40:18,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1890 states. [2024-11-10 17:40:18,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1890 to 1890. [2024-11-10 17:40:18,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1890 states, 1361 states have (on average 1.7744305657604702) internal successors, (2415), 1846 states have internal predecessors, (2415), 38 states have call successors, (38), 16 states have call predecessors, (38), 14 states have return successors, (35), 30 states have call predecessors, (35), 34 states have call successors, (35) [2024-11-10 17:40:18,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1890 states to 1890 states and 2488 transitions. [2024-11-10 17:40:18,443 INFO L78 Accepts]: Start accepts. Automaton has 1890 states and 2488 transitions. Word has length 86 [2024-11-10 17:40:18,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:18,444 INFO L471 AbstractCegarLoop]: Abstraction has 1890 states and 2488 transitions. [2024-11-10 17:40:18,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 11.571428571428571) internal successors, (81), 7 states have internal predecessors, (81), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 17:40:18,444 INFO L276 IsEmpty]: Start isEmpty. Operand 1890 states and 2488 transitions. [2024-11-10 17:40:18,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 17:40:18,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:18,445 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:40:18,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2024-11-10 17:40:18,645 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-10 17:40:18,646 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr509REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:40:18,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:18,647 INFO L85 PathProgramCache]: Analyzing trace with hash 698278914, now seen corresponding path program 1 times [2024-11-10 17:40:18,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:40:18,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [108009691] [2024-11-10 17:40:18,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:18,648 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-10 17:40:18,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:40:18,651 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-10 17:40:18,653 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-10 17:40:19,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:19,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 17:40:19,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:40:19,057 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-10 17:40:19,057 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 17:40:19,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:40:19,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [108009691] [2024-11-10 17:40:19,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [108009691] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:40:19,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:40:19,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 17:40:19,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273719055] [2024-11-10 17:40:19,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:40:19,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:40:19,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:40:19,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:40:19,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:40:19,059 INFO L87 Difference]: Start difference. First operand 1890 states and 2488 transitions. Second operand has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 17:40:19,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:19,112 INFO L93 Difference]: Finished difference Result 1906 states and 2506 transitions. [2024-11-10 17:40:19,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:40:19,113 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 94 [2024-11-10 17:40:19,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:19,116 INFO L225 Difference]: With dead ends: 1906 [2024-11-10 17:40:19,116 INFO L226 Difference]: Without dead ends: 1900 [2024-11-10 17:40:19,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:40:19,117 INFO L432 NwaCegarLoop]: 1166 mSDtfsCounter, 3 mSDsluCounter, 2323 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3489 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:19,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3489 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 17:40:19,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1900 states. [2024-11-10 17:40:19,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 1900. [2024-11-10 17:40:19,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1900 states, 1369 states have (on average 1.7713659605551497) internal successors, (2425), 1856 states have internal predecessors, (2425), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2024-11-10 17:40:19,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1900 states to 1900 states and 2500 transitions. [2024-11-10 17:40:19,136 INFO L78 Accepts]: Start accepts. Automaton has 1900 states and 2500 transitions. Word has length 94 [2024-11-10 17:40:19,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:19,137 INFO L471 AbstractCegarLoop]: Abstraction has 1900 states and 2500 transitions. [2024-11-10 17:40:19,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) internal successors, (88), 5 states have internal predecessors, (88), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-10 17:40:19,137 INFO L276 IsEmpty]: Start isEmpty. Operand 1900 states and 2500 transitions. [2024-11-10 17:40:19,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 17:40:19,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:19,140 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:40:19,152 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 (23)] Ended with exit code 0 [2024-11-10 17:40:19,340 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-10 17:40:19,341 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr509REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:40:19,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:19,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1391207657, now seen corresponding path program 1 times [2024-11-10 17:40:19,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:40:19,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453257048] [2024-11-10 17:40:19,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:19,342 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-10 17:40:19,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:40:19,343 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-10 17:40:19,344 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-10 17:40:19,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:19,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 17:40:19,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:40:19,703 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-10 17:40:19,704 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:40:19,806 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-10 17:40:19,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:40:19,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453257048] [2024-11-10 17:40:19,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453257048] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:40:19,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:40:19,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-10 17:40:19,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583914367] [2024-11-10 17:40:19,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:40:19,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 17:40:19,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:40:19,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 17:40:19,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-10 17:40:19,808 INFO L87 Difference]: Start difference. First operand 1900 states and 2500 transitions. Second operand has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 17:40:19,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:19,968 INFO L93 Difference]: Finished difference Result 1926 states and 2530 transitions. [2024-11-10 17:40:19,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 17:40:19,969 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 95 [2024-11-10 17:40:19,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:19,972 INFO L225 Difference]: With dead ends: 1926 [2024-11-10 17:40:19,972 INFO L226 Difference]: Without dead ends: 1914 [2024-11-10 17:40:19,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2024-11-10 17:40:19,973 INFO L432 NwaCegarLoop]: 1166 mSDtfsCounter, 19 mSDsluCounter, 5804 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 6970 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:19,976 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 6970 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:40:19,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2024-11-10 17:40:19,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1908. [2024-11-10 17:40:19,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1908 states, 1377 states have (on average 1.768336964415396) internal successors, (2435), 1864 states have internal predecessors, (2435), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2024-11-10 17:40:19,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 2510 transitions. [2024-11-10 17:40:19,999 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 2510 transitions. Word has length 95 [2024-11-10 17:40:19,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:19,999 INFO L471 AbstractCegarLoop]: Abstraction has 1908 states and 2510 transitions. [2024-11-10 17:40:20,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.7) internal successors, (97), 10 states have internal predecessors, (97), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 17:40:20,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2510 transitions. [2024-11-10 17:40:20,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 17:40:20,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:20,003 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:40:20,015 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 (24)] Ended with exit code 0 [2024-11-10 17:40:20,203 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-10 17:40:20,203 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr509REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:40:20,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:20,204 INFO L85 PathProgramCache]: Analyzing trace with hash -626097854, now seen corresponding path program 2 times [2024-11-10 17:40:20,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:40:20,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688113733] [2024-11-10 17:40:20,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 17:40:20,205 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:40:20,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:40:20,206 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-10 17:40:20,206 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-10 17:40:20,793 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 17:40:20,794 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:40:20,809 INFO L255 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 17:40:20,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:40:20,877 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-10 17:40:20,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:40:21,050 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-10 17:40:21,050 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:40:21,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688113733] [2024-11-10 17:40:21,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688113733] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:40:21,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:40:21,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-10 17:40:21,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226501211] [2024-11-10 17:40:21,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:40:21,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 17:40:21,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:40:21,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 17:40:21,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2024-11-10 17:40:21,052 INFO L87 Difference]: Start difference. First operand 1908 states and 2510 transitions. Second operand has 16 states, 16 states have (on average 6.4375) internal successors, (103), 16 states have internal predecessors, (103), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 17:40:21,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:21,499 INFO L93 Difference]: Finished difference Result 1944 states and 2560 transitions. [2024-11-10 17:40:21,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-10 17:40:21,500 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.4375) internal successors, (103), 16 states have internal predecessors, (103), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 98 [2024-11-10 17:40:21,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:21,503 INFO L225 Difference]: With dead ends: 1944 [2024-11-10 17:40:21,504 INFO L226 Difference]: Without dead ends: 1932 [2024-11-10 17:40:21,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=248, Invalid=454, Unknown=0, NotChecked=0, Total=702 [2024-11-10 17:40:21,505 INFO L432 NwaCegarLoop]: 1166 mSDtfsCounter, 29 mSDsluCounter, 10442 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 11608 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:21,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 11608 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 17:40:21,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2024-11-10 17:40:21,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1926. [2024-11-10 17:40:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1395 states have (on average 1.7627240143369176) internal successors, (2459), 1882 states have internal predecessors, (2459), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2024-11-10 17:40:21,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2534 transitions. [2024-11-10 17:40:21,528 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2534 transitions. Word has length 98 [2024-11-10 17:40:21,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:21,528 INFO L471 AbstractCegarLoop]: Abstraction has 1926 states and 2534 transitions. [2024-11-10 17:40:21,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.4375) internal successors, (103), 16 states have internal predecessors, (103), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 17:40:21,529 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2534 transitions. [2024-11-10 17:40:21,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-10 17:40:21,529 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:21,530 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:40:21,545 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 (25)] Forceful destruction successful, exit code 0 [2024-11-10 17:40:21,730 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-10 17:40:21,731 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr509REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:40:21,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:21,733 INFO L85 PathProgramCache]: Analyzing trace with hash 428851490, now seen corresponding path program 3 times [2024-11-10 17:40:21,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:40:21,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981663350] [2024-11-10 17:40:21,734 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-10 17:40:21,734 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-10 17:40:21,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:40:21,737 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-10 17:40:21,738 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-10 17:40:22,614 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-10 17:40:22,614 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:40:22,633 INFO L255 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-10 17:40:22,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:40:22,813 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-10 17:40:22,814 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:40:23,387 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-10 17:40:23,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:40:23,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981663350] [2024-11-10 17:40:23,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [981663350] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:40:23,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:40:23,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2024-11-10 17:40:23,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054886123] [2024-11-10 17:40:23,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:40:23,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-10 17:40:23,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:40:23,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-10 17:40:23,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=534, Unknown=0, NotChecked=0, Total=756 [2024-11-10 17:40:23,390 INFO L87 Difference]: Start difference. First operand 1926 states and 2534 transitions. Second operand has 28 states, 28 states have (on average 4.107142857142857) internal successors, (115), 28 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 17:40:25,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:25,106 INFO L93 Difference]: Finished difference Result 1980 states and 2618 transitions. [2024-11-10 17:40:25,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2024-11-10 17:40:25,106 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.107142857142857) internal successors, (115), 28 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 104 [2024-11-10 17:40:25,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:25,108 INFO L225 Difference]: With dead ends: 1980 [2024-11-10 17:40:25,108 INFO L226 Difference]: Without dead ends: 1962 [2024-11-10 17:40:25,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=854, Invalid=1696, Unknown=0, NotChecked=0, Total=2550 [2024-11-10 17:40:25,110 INFO L432 NwaCegarLoop]: 1166 mSDtfsCounter, 60 mSDsluCounter, 16255 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 17421 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:25,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 17421 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 17:40:25,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2024-11-10 17:40:25,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1962. [2024-11-10 17:40:25,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1431 states have (on average 1.750524109014675) internal successors, (2505), 1918 states have internal predecessors, (2505), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2024-11-10 17:40:25,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2580 transitions. [2024-11-10 17:40:25,131 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2580 transitions. Word has length 104 [2024-11-10 17:40:25,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:25,131 INFO L471 AbstractCegarLoop]: Abstraction has 1962 states and 2580 transitions. [2024-11-10 17:40:25,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.107142857142857) internal successors, (115), 28 states have internal predecessors, (115), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 17:40:25,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2580 transitions. [2024-11-10 17:40:25,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 17:40:25,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:25,133 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:40:25,146 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-10 17:40:25,333 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-10 17:40:25,334 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr509REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:40:25,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:25,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1000732446, now seen corresponding path program 4 times [2024-11-10 17:40:25,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:40:25,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313968859] [2024-11-10 17:40:25,335 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-10 17:40:25,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 17:40:25,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:40:25,336 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-10 17:40:25,338 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-10 17:40:26,027 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-10 17:40:26,027 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:40:26,049 INFO L255 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 17:40:26,053 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:40:26,581 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-10 17:40:26,582 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:40:27,856 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-10 17:40:27,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 17:40:27,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313968859] [2024-11-10 17:40:27,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [313968859] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 17:40:27,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:40:27,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-10 17:40:27,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602782917] [2024-11-10 17:40:27,857 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:40:27,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-10 17:40:27,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 17:40:27,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-10 17:40:27,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=725, Invalid=1927, Unknown=0, NotChecked=0, Total=2652 [2024-11-10 17:40:27,859 INFO L87 Difference]: Start difference. First operand 1962 states and 2580 transitions. Second operand has 52 states, 52 states have (on average 2.673076923076923) internal successors, (139), 52 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 17:40:36,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:36,246 INFO L93 Difference]: Finished difference Result 2048 states and 2730 transitions. [2024-11-10 17:40:36,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-10 17:40:36,248 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.673076923076923) internal successors, (139), 52 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 116 [2024-11-10 17:40:36,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:36,251 INFO L225 Difference]: With dead ends: 2048 [2024-11-10 17:40:36,251 INFO L226 Difference]: Without dead ends: 2036 [2024-11-10 17:40:36,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=2955, Invalid=6357, Unknown=0, NotChecked=0, Total=9312 [2024-11-10 17:40:36,253 INFO L432 NwaCegarLoop]: 1166 mSDtfsCounter, 151 mSDsluCounter, 27879 mSDsCounter, 0 mSdLazyCounter, 1816 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 29045 SdHoareTripleChecker+Invalid, 1899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:36,255 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 29045 Invalid, 1899 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [83 Valid, 1816 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-10 17:40:36,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2024-11-10 17:40:36,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 2030. [2024-11-10 17:40:36,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2030 states, 1499 states have (on average 1.732488325550367) internal successors, (2597), 1986 states have internal predecessors, (2597), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 30 states have call predecessors, (37), 34 states have call successors, (37) [2024-11-10 17:40:36,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2030 states to 2030 states and 2672 transitions. [2024-11-10 17:40:36,278 INFO L78 Accepts]: Start accepts. Automaton has 2030 states and 2672 transitions. Word has length 116 [2024-11-10 17:40:36,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:36,279 INFO L471 AbstractCegarLoop]: Abstraction has 2030 states and 2672 transitions. [2024-11-10 17:40:36,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.673076923076923) internal successors, (139), 52 states have internal predecessors, (139), 1 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-10 17:40:36,279 INFO L276 IsEmpty]: Start isEmpty. Operand 2030 states and 2672 transitions. [2024-11-10 17:40:36,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-10 17:40:36,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:36,281 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:40:36,298 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-10 17:40:36,481 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-10 17:40:36,482 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr509REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, alt_mallocErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alt_mallocErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 622 more)] === [2024-11-10 17:40:36,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:36,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1245166142, now seen corresponding path program 5 times [2024-11-10 17:40:36,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 17:40:36,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784167568] [2024-11-10 17:40:36,483 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-10 17:40:36,483 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-10 17:40:36,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 17:40:36,486 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-10 17:40:36,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2024-11-10 17:40:37,819 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2024-11-10 17:40:37,820 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 17:40:37,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 934 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-10 17:40:37,857 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:40:37,863 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-10 17:40:38,002 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-10 17:40:38,002 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-10 17:40:38,025 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-10 17:40:38,133 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