./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:22:55,492 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:22:55,551 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-19 06:22:55,568 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:22:55,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:22:55,606 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:22:55,607 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:22:55,608 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:22:55,608 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:22:55,610 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:22:55,610 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:22:55,610 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:22:55,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:22:55,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:22:55,611 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:22:55,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:22:55,612 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:22:55,612 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:22:55,613 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:22:55,613 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:22:55,616 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:22:55,616 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:22:55,617 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:22:55,617 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:22:55,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:22:55,617 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:22:55,618 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:22:55,618 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:22:55,618 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:22:55,619 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:22:55,619 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:22:55,619 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:22:55,620 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:22:55,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:22:55,620 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:22:55,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:22:55,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:22:55,621 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:22:55,621 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:22:55,622 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:22:55,622 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:22:55,623 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:22:55,624 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:22:55,624 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:22:55,624 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:22:55,624 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-memcleanup) ) 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2024-11-19 06:22:55,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:22:55,935 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:22:55,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:22:55,939 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:22:55,941 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:22:55,943 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_nondet_test1-2.i [2024-11-19 06:22:57,418 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:22:57,737 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:22:57,738 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-2.i [2024-11-19 06:22:57,767 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fae7e055/24ad90b151f0470f95e28c090c3306d6/FLAG144cd8ea3 [2024-11-19 06:22:58,003 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fae7e055/24ad90b151f0470f95e28c090c3306d6 [2024-11-19 06:22:58,005 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:22:58,006 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:22:58,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:22:58,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:22:58,013 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:22:58,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:22:58" (1/1) ... [2024-11-19 06:22:58,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ee4a638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:22:58, skipping insertion in model container [2024-11-19 06:22:58,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:22:58" (1/1) ... [2024-11-19 06:22:58,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:22:58,577 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:22:58,618 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:22:58,624 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:22:58,628 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:22:58,638 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:22:58,660 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:22:58,661 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:22:58,663 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:22:58,665 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:22:58,666 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:22:58,667 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:22:58,671 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:22:58,675 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:22:58,687 ERROR L321 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2024-11-19 06:22:58,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4e01f8a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:22:58, skipping insertion in model container [2024-11-19 06:22:58,688 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:22:58,688 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2024-11-19 06:22:58,690 INFO L158 Benchmark]: Toolchain (without parser) took 683.42ms. Allocated memory is still 157.3MB. Free memory was 108.5MB in the beginning and 87.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 06:22:58,691 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 157.3MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 06:22:58,692 INFO L158 Benchmark]: CACSL2BoogieTranslator took 681.10ms. Allocated memory is still 157.3MB. Free memory was 108.5MB in the beginning and 87.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 06:22:58,693 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.28ms. Allocated memory is still 157.3MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 681.10ms. Allocated memory is still 157.3MB. Free memory was 108.5MB in the beginning and 87.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 753]: 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_nondet_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:23:00,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:23:00,827 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2024-11-19 06:23:00,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:23:00,835 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:23:00,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:23:00,872 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:23:00,873 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:23:00,874 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:23:00,875 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:23:00,875 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:23:00,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:23:00,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:23:00,878 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:23:00,878 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:23:00,878 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:23:00,879 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 06:23:00,879 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:23:00,879 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:23:00,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:23:00,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:23:00,884 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 06:23:00,884 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:23:00,884 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:23:00,885 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:23:00,885 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 06:23:00,885 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:23:00,885 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 06:23:00,886 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:23:00,886 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 06:23:00,886 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:23:00,886 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:23:00,887 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 06:23:00,887 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:23:00,887 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:23:00,888 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:23:00,888 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:23:00,888 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:23:00,888 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:23:00,889 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:23:00,889 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:23:00,890 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 06:23:00,891 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 06:23:00,891 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:23:00,891 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:23:00,891 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:23:00,892 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:23:00,892 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-memcleanup) ) 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 -> 112ef0f8366461020cac5f2ac7dec2d7e41f31b24e653cd7734885d2bb23b087 [2024-11-19 06:23:01,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:23:01,265 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:23:01,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:23:01,271 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:23:01,272 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:23:01,273 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_nondet_test1-2.i [2024-11-19 06:23:02,777 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:23:03,084 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:23:03,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test1-2.i [2024-11-19 06:23:03,103 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76fdef8b7/b6917080749744c58b96a6399bbe5e8c/FLAG6cb97f417 [2024-11-19 06:23:03,115 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/76fdef8b7/b6917080749744c58b96a6399bbe5e8c [2024-11-19 06:23:03,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:23:03,122 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:23:03,125 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:23:03,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:23:03,130 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:23:03,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:23:03" (1/1) ... [2024-11-19 06:23:03,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b86d6c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:03, skipping insertion in model container [2024-11-19 06:23:03,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:23:03" (1/1) ... [2024-11-19 06:23:03,215 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:23:03,609 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:03,645 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:03,652 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:03,656 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:03,663 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:03,683 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:03,687 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:03,689 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:03,693 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:03,693 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:03,694 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:03,700 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:03,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:23:03,728 INFO L197 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2024-11-19 06:23:03,736 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:23:03,775 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:03,812 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:03,814 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:03,816 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:03,819 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:03,826 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:03,827 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:03,829 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:03,829 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:03,830 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:03,831 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:03,833 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 06:23:03,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:23:03,840 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:23:03,906 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:23:03,952 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:23:03,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:03 WrapperNode [2024-11-19 06:23:03,952 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:23:03,953 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:23:03,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:23:03,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:23:03,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:03" (1/1) ... [2024-11-19 06:23:03,996 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:03" (1/1) ... [2024-11-19 06:23:04,059 INFO L138 Inliner]: procedures = 179, calls = 221, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 747 [2024-11-19 06:23:04,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:23:04,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:23:04,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:23:04,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:23:04,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:03" (1/1) ... [2024-11-19 06:23:04,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:03" (1/1) ... [2024-11-19 06:23:04,097 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:03" (1/1) ... [2024-11-19 06:23:04,172 INFO L175 MemorySlicer]: Split 206 memory accesses to 2 slices as follows [2, 204]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 50 writes are split as follows [0, 50]. [2024-11-19 06:23:04,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:03" (1/1) ... [2024-11-19 06:23:04,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:03" (1/1) ... [2024-11-19 06:23:04,223 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:03" (1/1) ... [2024-11-19 06:23:04,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:03" (1/1) ... [2024-11-19 06:23:04,245 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:03" (1/1) ... [2024-11-19 06:23:04,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:03" (1/1) ... [2024-11-19 06:23:04,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:23:04,272 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:23:04,273 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:23:04,273 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:23:04,274 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:03" (1/1) ... [2024-11-19 06:23:04,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:23:04,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:23:04,308 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:23:04,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:23:04,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 06:23:04,352 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 06:23:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 06:23:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 06:23:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-19 06:23:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-19 06:23:04,353 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-19 06:23:04,353 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-19 06:23:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:23:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:23:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:23:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:23:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:23:04,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:23:04,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:23:04,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 06:23:04,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 06:23:04,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 06:23:04,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 06:23:04,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:23:04,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:23:04,558 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:23:04,561 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:23:10,551 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-11-19 06:23:10,552 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:23:10,571 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:23:10,572 INFO L316 CfgBuilder]: Removed 40 assume(true) statements. [2024-11-19 06:23:10,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:23:10 BoogieIcfgContainer [2024-11-19 06:23:10,573 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:23:10,575 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:23:10,575 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:23:10,578 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:23:10,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:23:03" (1/3) ... [2024-11-19 06:23:10,579 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@523d81ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:23:10, skipping insertion in model container [2024-11-19 06:23:10,579 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:23:03" (2/3) ... [2024-11-19 06:23:10,580 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@523d81ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:23:10, skipping insertion in model container [2024-11-19 06:23:10,580 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:23:10" (3/3) ... [2024-11-19 06:23:10,581 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test1-2.i [2024-11-19 06:23:10,599 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:23:10,599 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-19 06:23:10,645 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:23:10,652 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;@2b027ea4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:23:10,652 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-19 06:23:10,656 INFO L276 IsEmpty]: Start isEmpty. Operand has 140 states, 133 states have (on average 1.6390977443609023) internal successors, (218), 135 states have internal predecessors, (218), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:23:10,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:23:10,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:10,662 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:23:10,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:10,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:10,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1673007985, now seen corresponding path program 1 times [2024-11-19 06:23:10,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:23:10,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474653085] [2024-11-19 06:23:10,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:23:10,682 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:10,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:23:10,685 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:23:10,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 06:23:10,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:23:10,836 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 06:23:10,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:23:10,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:23:10,850 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:23:10,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:23:10,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474653085] [2024-11-19 06:23:10,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474653085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:23:10,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:23:10,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:23:10,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229901602] [2024-11-19 06:23:10,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:23:10,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:23:10,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:23:10,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:23:10,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:23:10,891 INFO L87 Difference]: Start difference. First operand has 140 states, 133 states have (on average 1.6390977443609023) internal successors, (218), 135 states have internal predecessors, (218), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-19 06:23:10,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:10,925 INFO L93 Difference]: Finished difference Result 139 states and 177 transitions. [2024-11-19 06:23:10,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:23:10,927 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-19 06:23:10,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:10,933 INFO L225 Difference]: With dead ends: 139 [2024-11-19 06:23:10,933 INFO L226 Difference]: Without dead ends: 137 [2024-11-19 06:23:10,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:23:10,938 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:10,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:23:10,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-19 06:23:10,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2024-11-19 06:23:10,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 131 states have (on average 1.2900763358778626) internal successors, (169), 132 states have internal predecessors, (169), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:23:10,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 175 transitions. [2024-11-19 06:23:10,995 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 175 transitions. Word has length 9 [2024-11-19 06:23:10,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:10,999 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 175 transitions. [2024-11-19 06:23:11,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 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-19 06:23:11,000 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 175 transitions. [2024-11-19 06:23:11,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 06:23:11,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:11,000 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:23:11,007 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 06:23:11,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:11,202 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:11,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:11,202 INFO L85 PathProgramCache]: Analyzing trace with hash 738674175, now seen corresponding path program 1 times [2024-11-19 06:23:11,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:23:11,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300048034] [2024-11-19 06:23:11,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:23:11,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:11,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:23:11,205 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:23:11,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 (3)] Waiting until timeout for monitored process [2024-11-19 06:23:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:23:11,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 06:23:11,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:23:11,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:23:11,329 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:23:11,329 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:23:11,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300048034] [2024-11-19 06:23:11,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300048034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:23:11,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:23:11,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:23:11,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107892658] [2024-11-19 06:23:11,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:23:11,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:23:11,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:23:11,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:23:11,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:23:11,333 INFO L87 Difference]: Start difference. First operand 137 states and 175 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-19 06:23:11,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:11,442 INFO L93 Difference]: Finished difference Result 226 states and 290 transitions. [2024-11-19 06:23:11,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:23:11,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-19 06:23:11,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:11,449 INFO L225 Difference]: With dead ends: 226 [2024-11-19 06:23:11,449 INFO L226 Difference]: Without dead ends: 226 [2024-11-19 06:23:11,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-19 06:23:11,450 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 108 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:11,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 369 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:23:11,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-11-19 06:23:11,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 138. [2024-11-19 06:23:11,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 132 states have (on average 1.2878787878787878) internal successors, (170), 133 states have internal predecessors, (170), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:23:11,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 176 transitions. [2024-11-19 06:23:11,468 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 176 transitions. Word has length 9 [2024-11-19 06:23:11,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:11,468 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 176 transitions. [2024-11-19 06:23:11,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 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-19 06:23:11,469 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 176 transitions. [2024-11-19 06:23:11,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 06:23:11,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:11,471 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:23:11,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 06:23:11,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:11,672 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:11,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:11,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1816778816, now seen corresponding path program 1 times [2024-11-19 06:23:11,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:23:11,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [442334089] [2024-11-19 06:23:11,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:23:11,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-19 06:23:11,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:23:11,677 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:23:11,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 06:23:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:23:12,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:23:12,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:23:12,100 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:23:12,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:23:12,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:23:12,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [442334089] [2024-11-19 06:23:12,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [442334089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:23:12,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:23:12,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:23:12,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736442905] [2024-11-19 06:23:12,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:23:12,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:23:12,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:23:12,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:23:12,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:23:12,103 INFO L87 Difference]: Start difference. First operand 138 states and 176 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-19 06:23:12,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:12,279 INFO L93 Difference]: Finished difference Result 141 states and 171 transitions. [2024-11-19 06:23:12,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:23:12,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2024-11-19 06:23:12,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:12,282 INFO L225 Difference]: With dead ends: 141 [2024-11-19 06:23:12,282 INFO L226 Difference]: Without dead ends: 141 [2024-11-19 06:23:12,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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-19 06:23:12,283 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 30 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:12,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 416 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:23:12,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-19 06:23:12,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2024-11-19 06:23:12,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 135 states have (on average 1.2222222222222223) internal successors, (165), 136 states have internal predecessors, (165), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:23:12,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 171 transitions. [2024-11-19 06:23:12,292 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 171 transitions. Word has length 64 [2024-11-19 06:23:12,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:12,292 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 171 transitions. [2024-11-19 06:23:12,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-19 06:23:12,292 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 171 transitions. [2024-11-19 06:23:12,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 06:23:12,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:12,294 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:23:12,301 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-19 06:23:12,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:12,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:12,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:12,496 INFO L85 PathProgramCache]: Analyzing trace with hash 243531316, now seen corresponding path program 1 times [2024-11-19 06:23:12,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:23:12,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316303538] [2024-11-19 06:23:12,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:23:12,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:12,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:23:12,498 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:23:12,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 06:23:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:23:12,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 06:23:12,803 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:23:12,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:23:12,983 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:23:12,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:23:12,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316303538] [2024-11-19 06:23:12,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316303538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:23:12,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:23:12,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:23:12,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025484645] [2024-11-19 06:23:12,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:23:12,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:23:12,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:23:12,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:23:12,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:23:12,989 INFO L87 Difference]: Start difference. First operand 141 states and 171 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-19 06:23:13,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:13,093 INFO L93 Difference]: Finished difference Result 135 states and 161 transitions. [2024-11-19 06:23:13,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:23:13,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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 64 [2024-11-19 06:23:13,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:13,095 INFO L225 Difference]: With dead ends: 135 [2024-11-19 06:23:13,095 INFO L226 Difference]: Without dead ends: 135 [2024-11-19 06:23:13,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:23:13,097 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:13,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 413 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:23:13,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-19 06:23:13,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2024-11-19 06:23:13,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 129 states have (on average 1.2015503875968991) internal successors, (155), 130 states have internal predecessors, (155), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:23:13,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 161 transitions. [2024-11-19 06:23:13,114 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 161 transitions. Word has length 64 [2024-11-19 06:23:13,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:13,115 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 161 transitions. [2024-11-19 06:23:13,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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-19 06:23:13,115 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 161 transitions. [2024-11-19 06:23:13,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-19 06:23:13,120 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:13,120 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:23:13,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 06:23:13,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:13,321 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:13,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:13,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1807452682, now seen corresponding path program 1 times [2024-11-19 06:23:13,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:23:13,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [405239434] [2024-11-19 06:23:13,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:23:13,323 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:13,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:23:13,326 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:23:13,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 06:23:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:23:13,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:23:13,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:23:13,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:23:13,940 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:23:13,940 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:23:13,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [405239434] [2024-11-19 06:23:13,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [405239434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:23:13,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:23:13,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:23:13,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375274861] [2024-11-19 06:23:13,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:23:13,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:23:13,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:23:13,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:23:13,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:23:13,942 INFO L87 Difference]: Start difference. First operand 135 states and 161 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-19 06:23:14,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:14,330 INFO L93 Difference]: Finished difference Result 202 states and 237 transitions. [2024-11-19 06:23:14,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:23:14,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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 64 [2024-11-19 06:23:14,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:14,335 INFO L225 Difference]: With dead ends: 202 [2024-11-19 06:23:14,335 INFO L226 Difference]: Without dead ends: 202 [2024-11-19 06:23:14,336 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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-19 06:23:14,337 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 38 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:14,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 323 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:23:14,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-19 06:23:14,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 171. [2024-11-19 06:23:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 165 states have (on average 1.1575757575757575) internal successors, (191), 166 states have internal predecessors, (191), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-19 06:23:14,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 197 transitions. [2024-11-19 06:23:14,352 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 197 transitions. Word has length 64 [2024-11-19 06:23:14,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:14,353 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 197 transitions. [2024-11-19 06:23:14,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 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-19 06:23:14,353 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 197 transitions. [2024-11-19 06:23:14,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-19 06:23:14,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:14,356 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:23:14,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 (6)] Ended with exit code 0 [2024-11-19 06:23:14,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:14,557 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:14,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:14,557 INFO L85 PathProgramCache]: Analyzing trace with hash 38949275, now seen corresponding path program 1 times [2024-11-19 06:23:14,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:23:14,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1311749921] [2024-11-19 06:23:14,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:23:14,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:14,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:23:14,562 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:23:14,563 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 06:23:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:23:14,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:23:14,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:23:15,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:23:15,010 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:23:15,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:23:15,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1311749921] [2024-11-19 06:23:15,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1311749921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:23:15,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:23:15,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:23:15,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769537430] [2024-11-19 06:23:15,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:23:15,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:23:15,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:23:15,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:23:15,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:23:15,014 INFO L87 Difference]: Start difference. First operand 171 states and 197 transitions. Second operand has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:23:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:15,062 INFO L93 Difference]: Finished difference Result 174 states and 201 transitions. [2024-11-19 06:23:15,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:23:15,063 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 79 [2024-11-19 06:23:15,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:15,065 INFO L225 Difference]: With dead ends: 174 [2024-11-19 06:23:15,066 INFO L226 Difference]: Without dead ends: 174 [2024-11-19 06:23:15,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:23:15,067 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 0 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:15,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 467 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:23:15,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-19 06:23:15,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-11-19 06:23:15,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 167 states have (on average 1.1616766467065869) internal successors, (194), 169 states have internal predecessors, (194), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:23:15,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 201 transitions. [2024-11-19 06:23:15,082 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 201 transitions. Word has length 79 [2024-11-19 06:23:15,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:15,083 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 201 transitions. [2024-11-19 06:23:15,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.75) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:23:15,083 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 201 transitions. [2024-11-19 06:23:15,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-19 06:23:15,084 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:15,084 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:23:15,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 06:23:15,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:15,285 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:15,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:15,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1292726919, now seen corresponding path program 1 times [2024-11-19 06:23:15,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:23:15,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85275479] [2024-11-19 06:23:15,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:23:15,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:15,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:23:15,288 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:23:15,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 06:23:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:23:15,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:23:15,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:23:15,727 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:23:15,727 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:23:15,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-19 06:23:15,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:23:15,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85275479] [2024-11-19 06:23:15,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85275479] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:23:15,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:23:15,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-19 06:23:15,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582912340] [2024-11-19 06:23:15,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:23:15,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:23:15,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:23:15,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:23:15,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:23:15,838 INFO L87 Difference]: Start difference. First operand 174 states and 201 transitions. Second operand has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:23:16,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:16,021 INFO L93 Difference]: Finished difference Result 185 states and 217 transitions. [2024-11-19 06:23:16,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:23:16,022 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 81 [2024-11-19 06:23:16,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:16,023 INFO L225 Difference]: With dead ends: 185 [2024-11-19 06:23:16,023 INFO L226 Difference]: Without dead ends: 185 [2024-11-19 06:23:16,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2024-11-19 06:23:16,024 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 5 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:16,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 623 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:23:16,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-19 06:23:16,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2024-11-19 06:23:16,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 175 states have (on average 1.1885714285714286) internal successors, (208), 177 states have internal predecessors, (208), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:23:16,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 215 transitions. [2024-11-19 06:23:16,029 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 215 transitions. Word has length 81 [2024-11-19 06:23:16,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:16,030 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 215 transitions. [2024-11-19 06:23:16,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.625) internal successors, (85), 8 states have internal predecessors, (85), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:23:16,030 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 215 transitions. [2024-11-19 06:23:16,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-19 06:23:16,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:16,031 INFO L215 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:23:16,043 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 06:23:16,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:16,236 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:16,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:16,236 INFO L85 PathProgramCache]: Analyzing trace with hash 152701467, now seen corresponding path program 2 times [2024-11-19 06:23:16,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:23:16,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [222067333] [2024-11-19 06:23:16,237 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:23:16,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-19 06:23:16,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:23:16,240 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:23:16,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 06:23:16,653 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:23:16,653 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:23:16,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 06:23:16,670 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:23:16,781 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-19 06:23:16,782 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:23:16,981 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 1 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-19 06:23:16,981 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:23:16,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [222067333] [2024-11-19 06:23:16,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [222067333] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:23:16,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:23:16,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-19 06:23:16,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662671355] [2024-11-19 06:23:16,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:23:16,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 06:23:16,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:23:16,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 06:23:16,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2024-11-19 06:23:16,984 INFO L87 Difference]: Start difference. First operand 183 states and 215 transitions. Second operand has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:23:17,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:17,709 INFO L93 Difference]: Finished difference Result 198 states and 237 transitions. [2024-11-19 06:23:17,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 06:23:17,710 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 85 [2024-11-19 06:23:17,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:17,712 INFO L225 Difference]: With dead ends: 198 [2024-11-19 06:23:17,712 INFO L226 Difference]: Without dead ends: 194 [2024-11-19 06:23:17,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=324, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:23:17,713 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 8 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:17,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 1087 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:23:17,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-19 06:23:17,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2024-11-19 06:23:17,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 184 states have (on average 1.1956521739130435) internal successors, (220), 186 states have internal predecessors, (220), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:23:17,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 227 transitions. [2024-11-19 06:23:17,719 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 227 transitions. Word has length 85 [2024-11-19 06:23:17,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:17,719 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 227 transitions. [2024-11-19 06:23:17,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.5) internal successors, (91), 14 states have internal predecessors, (91), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:23:17,719 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 227 transitions. [2024-11-19 06:23:17,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-19 06:23:17,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:17,720 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:23:17,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-19 06:23:17,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:17,921 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:17,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:17,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1944501211, now seen corresponding path program 3 times [2024-11-19 06:23:17,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:23:17,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060756873] [2024-11-19 06:23:17,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:23:17,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:17,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:23:17,924 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:23:17,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 06:23:18,239 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 06:23:18,239 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:23:18,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 06:23:18,250 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:23:18,420 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-19 06:23:18,420 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:23:18,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:23:18,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060756873] [2024-11-19 06:23:18,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060756873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:23:18,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:23:18,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:23:18,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256512256] [2024-11-19 06:23:18,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:23:18,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:23:18,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:23:18,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:23:18,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:23:18,422 INFO L87 Difference]: Start difference. First operand 192 states and 227 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:23:22,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 06:23:26,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 06:23:29,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 06:23:29,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:29,552 INFO L93 Difference]: Finished difference Result 265 states and 319 transitions. [2024-11-19 06:23:29,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:23:29,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 94 [2024-11-19 06:23:29,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:29,556 INFO L225 Difference]: With dead ends: 265 [2024-11-19 06:23:29,556 INFO L226 Difference]: Without dead ends: 265 [2024-11-19 06:23:29,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 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-19 06:23:29,557 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 255 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:29,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 302 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 2 Unknown, 0 Unchecked, 11.1s Time] [2024-11-19 06:23:29,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2024-11-19 06:23:29,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 194. [2024-11-19 06:23:29,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 186 states have (on average 1.1827956989247312) internal successors, (220), 188 states have internal predecessors, (220), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:23:29,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 227 transitions. [2024-11-19 06:23:29,565 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 227 transitions. Word has length 94 [2024-11-19 06:23:29,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:29,566 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 227 transitions. [2024-11-19 06:23:29,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:23:29,566 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 227 transitions. [2024-11-19 06:23:29,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-19 06:23:29,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:29,567 INFO L215 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:23:29,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-19 06:23:29,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:29,768 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:29,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:29,768 INFO L85 PathProgramCache]: Analyzing trace with hash 2004991129, now seen corresponding path program 1 times [2024-11-19 06:23:29,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:23:29,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524417940] [2024-11-19 06:23:29,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:23:29,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:29,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:23:29,770 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:23:29,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 06:23:30,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:23:30,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 06:23:30,257 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:23:30,429 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 70 proven. 55 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-19 06:23:30,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:23:31,057 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 1 proven. 123 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-19 06:23:31,057 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:23:31,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [524417940] [2024-11-19 06:23:31,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [524417940] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:23:31,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:23:31,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2024-11-19 06:23:31,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543018972] [2024-11-19 06:23:31,058 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:23:31,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-19 06:23:31,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:23:31,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-19 06:23:31,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2024-11-19 06:23:31,060 INFO L87 Difference]: Start difference. First operand 194 states and 227 transitions. Second operand has 26 states, 26 states have (on average 4.038461538461538) internal successors, (105), 26 states have internal predecessors, (105), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:23:32,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:32,843 INFO L93 Difference]: Finished difference Result 218 states and 267 transitions. [2024-11-19 06:23:32,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-19 06:23:32,844 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 4.038461538461538) internal successors, (105), 26 states have internal predecessors, (105), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 96 [2024-11-19 06:23:32,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:32,846 INFO L225 Difference]: With dead ends: 218 [2024-11-19 06:23:32,846 INFO L226 Difference]: Without dead ends: 214 [2024-11-19 06:23:32,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=728, Invalid=1434, Unknown=0, NotChecked=0, Total=2162 [2024-11-19 06:23:32,848 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 14 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 2004 SdHoareTripleChecker+Invalid, 579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:32,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 2004 Invalid, 579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 06:23:32,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-19 06:23:32,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2024-11-19 06:23:32,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 204 states have (on average 1.196078431372549) internal successors, (244), 206 states have internal predecessors, (244), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:23:32,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 251 transitions. [2024-11-19 06:23:32,855 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 251 transitions. Word has length 96 [2024-11-19 06:23:32,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:32,856 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 251 transitions. [2024-11-19 06:23:32,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 4.038461538461538) internal successors, (105), 26 states have internal predecessors, (105), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:23:32,856 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 251 transitions. [2024-11-19 06:23:32,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 06:23:32,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:32,857 INFO L215 NwaCegarLoop]: trace histogram [33, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:23:32,867 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-19 06:23:33,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:33,058 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:33,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:33,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1521405159, now seen corresponding path program 2 times [2024-11-19 06:23:33,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:23:33,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958893275] [2024-11-19 06:23:33,059 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:23:33,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:33,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:23:33,060 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:23:33,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 06:23:33,609 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:23:33,609 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:23:33,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-19 06:23:33,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:23:34,142 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 280 proven. 253 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-19 06:23:34,143 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:23:35,865 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 1 proven. 531 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-19 06:23:35,865 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:23:35,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958893275] [2024-11-19 06:23:35,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958893275] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:23:35,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:23:35,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2024-11-19 06:23:35,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095181252] [2024-11-19 06:23:35,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:23:35,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-19 06:23:35,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:23:35,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-19 06:23:35,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2024-11-19 06:23:35,869 INFO L87 Difference]: Start difference. First operand 212 states and 251 transitions. Second operand has 50 states, 50 states have (on average 2.58) internal successors, (129), 50 states have internal predecessors, (129), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:23:42,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:42,862 INFO L93 Difference]: Finished difference Result 252 states and 323 transitions. [2024-11-19 06:23:42,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2024-11-19 06:23:42,863 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.58) internal successors, (129), 50 states have internal predecessors, (129), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 114 [2024-11-19 06:23:42,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:42,867 INFO L225 Difference]: With dead ends: 252 [2024-11-19 06:23:42,867 INFO L226 Difference]: Without dead ends: 248 [2024-11-19 06:23:42,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=2713, Invalid=5843, Unknown=0, NotChecked=0, Total=8556 [2024-11-19 06:23:42,870 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 25 mSDsluCounter, 3545 mSDsCounter, 0 mSdLazyCounter, 1919 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 3701 SdHoareTripleChecker+Invalid, 1960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:42,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 3701 Invalid, 1960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1919 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-19 06:23:42,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-19 06:23:42,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2024-11-19 06:23:42,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 238 states have (on average 1.218487394957983) internal successors, (290), 240 states have internal predecessors, (290), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-19 06:23:42,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 297 transitions. [2024-11-19 06:23:42,879 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 297 transitions. Word has length 114 [2024-11-19 06:23:42,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:42,879 INFO L471 AbstractCegarLoop]: Abstraction has 246 states and 297 transitions. [2024-11-19 06:23:42,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.58) internal successors, (129), 50 states have internal predecessors, (129), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:23:42,880 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 297 transitions. [2024-11-19 06:23:42,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2024-11-19 06:23:42,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:42,882 INFO L215 NwaCegarLoop]: trace histogram [67, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:23:42,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2024-11-19 06:23:43,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:43,083 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:43,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:43,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1323431001, now seen corresponding path program 3 times [2024-11-19 06:23:43,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:23:43,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085216473] [2024-11-19 06:23:43,084 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 06:23:43,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:43,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:23:43,086 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:23:43,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 06:23:43,537 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 06:23:43,537 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:23:43,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 06:23:43,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:23:43,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2350 trivial. 0 not checked. [2024-11-19 06:23:43,717 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:23:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2351 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2350 trivial. 0 not checked. [2024-11-19 06:23:43,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:23:43,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085216473] [2024-11-19 06:23:43,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1085216473] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:23:43,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:23:43,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-19 06:23:43,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688126013] [2024-11-19 06:23:43,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:23:43,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:23:43,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:23:43,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:23:43,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:23:43,971 INFO L87 Difference]: Start difference. First operand 246 states and 297 transitions. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:23:44,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:44,302 INFO L93 Difference]: Finished difference Result 439 states and 526 transitions. [2024-11-19 06:23:44,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:23:44,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 148 [2024-11-19 06:23:44,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:44,306 INFO L225 Difference]: With dead ends: 439 [2024-11-19 06:23:44,306 INFO L226 Difference]: Without dead ends: 439 [2024-11-19 06:23:44,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 290 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:23:44,307 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 294 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:44,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 791 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:23:44,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-19 06:23:44,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 439. [2024-11-19 06:23:44,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 428 states have (on average 1.191588785046729) internal successors, (510), 430 states have internal predecessors, (510), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-19 06:23:44,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 526 transitions. [2024-11-19 06:23:44,317 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 526 transitions. Word has length 148 [2024-11-19 06:23:44,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:44,317 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 526 transitions. [2024-11-19 06:23:44,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:23:44,318 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 526 transitions. [2024-11-19 06:23:44,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2024-11-19 06:23:44,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:44,321 INFO L215 NwaCegarLoop]: trace histogram [67, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:23:44,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 06:23:44,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:44,526 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:44,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:44,526 INFO L85 PathProgramCache]: Analyzing trace with hash -707578696, now seen corresponding path program 1 times [2024-11-19 06:23:44,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:23:44,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1914348691] [2024-11-19 06:23:44,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:23:44,527 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:44,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:23:44,528 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:23:44,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 06:23:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:23:46,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 1952 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 06:23:46,198 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:23:46,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2678 backedges. 1194 proven. 276 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked. [2024-11-19 06:23:46,867 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:23:49,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2678 backedges. 1194 proven. 276 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked. [2024-11-19 06:23:49,284 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:23:49,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1914348691] [2024-11-19 06:23:49,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1914348691] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:23:49,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:23:49,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 52 [2024-11-19 06:23:49,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922871193] [2024-11-19 06:23:49,285 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:23:49,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-19 06:23:49,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:23:49,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-19 06:23:49,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=726, Invalid=1926, Unknown=0, NotChecked=0, Total=2652 [2024-11-19 06:23:49,288 INFO L87 Difference]: Start difference. First operand 439 states and 526 transitions. Second operand has 52 states, 52 states have (on average 3.1923076923076925) internal successors, (166), 52 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:23:57,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:23:57,894 INFO L93 Difference]: Finished difference Result 468 states and 586 transitions. [2024-11-19 06:23:57,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2024-11-19 06:23:57,895 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 3.1923076923076925) internal successors, (166), 52 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 313 [2024-11-19 06:23:57,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:23:57,897 INFO L225 Difference]: With dead ends: 468 [2024-11-19 06:23:57,897 INFO L226 Difference]: Without dead ends: 468 [2024-11-19 06:23:57,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 574 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1633 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=3146, Invalid=6556, Unknown=0, NotChecked=0, Total=9702 [2024-11-19 06:23:57,902 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 26 mSDsluCounter, 3675 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3830 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:23:57,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3830 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-19 06:23:57,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2024-11-19 06:23:57,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 464. [2024-11-19 06:23:57,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 453 states have (on average 1.2362030905077264) internal successors, (560), 455 states have internal predecessors, (560), 6 states have call successors, (6), 2 states have call predecessors, (6), 3 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-19 06:23:57,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 576 transitions. [2024-11-19 06:23:57,915 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 576 transitions. Word has length 313 [2024-11-19 06:23:57,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:23:57,915 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 576 transitions. [2024-11-19 06:23:57,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 3.1923076923076925) internal successors, (166), 52 states have internal predecessors, (166), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-19 06:23:57,916 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 576 transitions. [2024-11-19 06:23:57,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-11-19 06:23:57,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:23:57,918 INFO L215 NwaCegarLoop]: trace histogram [92, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:23:57,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-19 06:23:58,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:58,119 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-19 06:23:58,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:23:58,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1913644744, now seen corresponding path program 2 times [2024-11-19 06:23:58,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 06:23:58,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1968211912] [2024-11-19 06:23:58,121 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:23:58,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 06:23:58,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 06:23:58,122 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 06:23:58,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 06:24:00,465 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:24:00,466 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:24:00,534 INFO L255 TraceCheckSpWp]: Trace formula consists of 2227 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-19 06:24:00,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:24:02,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4703 backedges. 2319 proven. 1176 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked. [2024-11-19 06:24:02,439 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:24:09,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4703 backedges. 2319 proven. 1176 refuted. 0 times theorem prover too weak. 1208 trivial. 0 not checked. [2024-11-19 06:24:09,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 06:24:09,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1968211912] [2024-11-19 06:24:09,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1968211912] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:24:09,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:24:09,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 102 [2024-11-19 06:24:09,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795047564] [2024-11-19 06:24:09,998 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:24:09,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2024-11-19 06:24:09,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 06:24:10,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2024-11-19 06:24:10,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=7601, Unknown=0, NotChecked=0, Total=10302 [2024-11-19 06:24:10,002 INFO L87 Difference]: Start difference. First operand 464 states and 576 transitions. Second operand has 102 states, 102 states have (on average 2.1176470588235294) internal successors, (216), 102 states have internal predecessors, (216), 1 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3)