./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dbea62dc4a872959247118f049e63d406eb1e848bb1ed8397f1082fdec77074c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:37:58,665 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:37:58,733 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:37:58,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:37:58,737 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:37:58,768 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:37:58,769 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:37:58,769 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:37:58,770 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:37:58,771 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:37:58,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:37:58,772 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:37:58,772 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:37:58,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:37:58,773 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:37:58,773 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:37:58,773 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:37:58,774 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:37:58,774 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:37:58,774 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:37:58,774 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:37:58,778 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:37:58,778 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:37:58,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:37:58,779 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:37:58,779 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:37:58,779 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:37:58,779 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:37:58,779 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:37:58,780 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:37:58,780 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:37:58,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:37:58,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:37:58,781 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:37:58,781 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:37:58,781 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:37:58,781 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:37:58,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:37:58,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:37:58,784 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:37:58,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:37:58,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:37:58,785 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> dbea62dc4a872959247118f049e63d406eb1e848bb1ed8397f1082fdec77074c [2024-11-10 17:37:59,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:37:59,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:37:59,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:37:59,052 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:37:59,052 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:37:59,054 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_test2-1.i [2024-11-10 17:38:00,448 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:38:00,738 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:38:00,738 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test2-1.i [2024-11-10 17:38:00,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36822c8ca/6146c009777048d18805d585786c0bb3/FLAGc73a40dda [2024-11-10 17:38:00,785 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/36822c8ca/6146c009777048d18805d585786c0bb3 [2024-11-10 17:38:00,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:38:00,789 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:38:00,792 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:38:00,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:38:00,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:38:00,798 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:38:00" (1/1) ... [2024-11-10 17:38:00,799 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bd48af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:00, skipping insertion in model container [2024-11-10 17:38:00,799 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:38:00" (1/1) ... [2024-11-10 17:38:00,856 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:38:01,311 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:38:01,351 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:38:01,357 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:38:01,361 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:38:01,369 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:38:01,406 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:38:01,409 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:38:01,411 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:38:01,412 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:38:01,425 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:38:01,435 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:38:01,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:38:01,572 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:38:01,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:01 WrapperNode [2024-11-10 17:38:01,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:38:01,575 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:38:01,575 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:38:01,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:38:01,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:01" (1/1) ... [2024-11-10 17:38:01,616 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:01" (1/1) ... [2024-11-10 17:38:01,695 INFO L138 Inliner]: procedures = 208, calls = 229, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1282 [2024-11-10 17:38:01,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:38:01,698 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:38:01,698 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:38:01,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:38:01,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:01" (1/1) ... [2024-11-10 17:38:01,709 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:01" (1/1) ... [2024-11-10 17:38:01,725 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:01" (1/1) ... [2024-11-10 17:38:01,786 INFO L175 MemorySlicer]: Split 208 memory accesses to 3 slices as follows [2, 34, 172]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2024-11-10 17:38:01,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:01" (1/1) ... [2024-11-10 17:38:01,790 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:01" (1/1) ... [2024-11-10 17:38:01,831 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:01" (1/1) ... [2024-11-10 17:38:01,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:01" (1/1) ... [2024-11-10 17:38:01,836 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:01" (1/1) ... [2024-11-10 17:38:01,840 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:01" (1/1) ... [2024-11-10 17:38:01,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:38:01,847 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:38:01,847 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:38:01,848 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:38:01,852 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:01" (1/1) ... [2024-11-10 17:38:01,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:38:01,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:38:01,886 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 17:38:01,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 17:38:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-10 17:38:01,953 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-10 17:38:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 17:38:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 17:38:01,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-10 17:38:01,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 17:38:01,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 17:38:01,953 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-10 17:38:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 17:38:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 17:38:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 17:38:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-10 17:38:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 17:38:01,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 17:38:01,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 17:38:01,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-10 17:38:01,973 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 17:38:01,973 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 17:38:01,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 17:38:01,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 17:38:01,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-10 17:38:01,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 17:38:01,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:38:01,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 17:38:01,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 17:38:01,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-10 17:38:01,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 17:38:01,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 17:38:01,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-10 17:38:01,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:38:01,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:38:02,156 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:38:02,158 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:38:04,054 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-10 17:38:04,188 INFO L? ?]: Removed 1042 outVars from TransFormulas that were not future-live. [2024-11-10 17:38:04,189 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:38:04,268 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:38:04,271 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-10 17:38:04,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:38:04 BoogieIcfgContainer [2024-11-10 17:38:04,272 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:38:04,274 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:38:04,275 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:38:04,278 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:38:04,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:38:00" (1/3) ... [2024-11-10 17:38:04,279 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b3af1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:38:04, skipping insertion in model container [2024-11-10 17:38:04,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:01" (2/3) ... [2024-11-10 17:38:04,281 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51b3af1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:38:04, skipping insertion in model container [2024-11-10 17:38:04,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:38:04" (3/3) ... [2024-11-10 17:38:04,283 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test2-1.i [2024-11-10 17:38:04,299 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:38:04,300 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 424 error locations. [2024-11-10 17:38:04,374 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:38:04,384 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;@25c096ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:38:04,384 INFO L334 AbstractCegarLoop]: Starting to check reachability of 424 error locations. [2024-11-10 17:38:04,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 1096 states, 661 states have (on average 1.9818456883509834) internal successors, (1310), 1089 states have internal predecessors, (1310), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-10 17:38:04,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 17:38:04,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:04,400 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 17:38:04,401 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr421REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:04,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:04,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1401090, now seen corresponding path program 1 times [2024-11-10 17:38:04,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:04,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970769465] [2024-11-10 17:38:04,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:04,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:04,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:04,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:04,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:04,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970769465] [2024-11-10 17:38:04,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970769465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:04,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:04,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:38:04,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476201518] [2024-11-10 17:38:04,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:04,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:38:04,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:04,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:38:04,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:38:04,662 INFO L87 Difference]: Start difference. First operand has 1096 states, 661 states have (on average 1.9818456883509834) internal successors, (1310), 1089 states have internal predecessors, (1310), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:05,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:05,439 INFO L93 Difference]: Finished difference Result 1081 states and 1255 transitions. [2024-11-10 17:38:05,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:38:05,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-10 17:38:05,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:05,471 INFO L225 Difference]: With dead ends: 1081 [2024-11-10 17:38:05,471 INFO L226 Difference]: Without dead ends: 1078 [2024-11-10 17:38:05,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:38:05,479 INFO L432 NwaCegarLoop]: 824 mSDtfsCounter, 1118 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:05,480 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 877 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 17:38:05,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1078 states. [2024-11-10 17:38:05,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1078 to 1078. [2024-11-10 17:38:05,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 661 states have (on average 1.8668683812405447) internal successors, (1234), 1071 states have internal predecessors, (1234), 10 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 4 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-10 17:38:05,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1252 transitions. [2024-11-10 17:38:05,588 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1252 transitions. Word has length 3 [2024-11-10 17:38:05,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:05,589 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1252 transitions. [2024-11-10 17:38:05,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:05,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1252 transitions. [2024-11-10 17:38:05,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-10 17:38:05,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:05,590 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-10 17:38:05,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 17:38:05,590 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr422REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:05,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:05,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1401091, now seen corresponding path program 1 times [2024-11-10 17:38:05,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:05,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456642746] [2024-11-10 17:38:05,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:05,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:05,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:05,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:05,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456642746] [2024-11-10 17:38:05,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456642746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:05,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:05,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:38:05,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685842204] [2024-11-10 17:38:05,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:05,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:38:05,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:05,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:38:05,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:38:05,688 INFO L87 Difference]: Start difference. First operand 1078 states and 1252 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:06,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:06,662 INFO L93 Difference]: Finished difference Result 1865 states and 2201 transitions. [2024-11-10 17:38:06,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:38:06,664 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-10 17:38:06,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:06,672 INFO L225 Difference]: With dead ends: 1865 [2024-11-10 17:38:06,672 INFO L226 Difference]: Without dead ends: 1865 [2024-11-10 17:38:06,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:38:06,674 INFO L432 NwaCegarLoop]: 926 mSDtfsCounter, 931 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 1698 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:06,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 1698 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 17:38:06,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2024-11-10 17:38:06,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1601. [2024-11-10 17:38:06,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1180 states have (on average 1.8296610169491525) internal successors, (2159), 1592 states have internal predecessors, (2159), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 17:38:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2191 transitions. [2024-11-10 17:38:06,723 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2191 transitions. Word has length 3 [2024-11-10 17:38:06,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:06,724 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2191 transitions. [2024-11-10 17:38:06,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:06,724 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2191 transitions. [2024-11-10 17:38:06,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 17:38:06,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:06,725 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:06,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 17:38:06,725 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr415REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:06,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:06,726 INFO L85 PathProgramCache]: Analyzing trace with hash -972013480, now seen corresponding path program 1 times [2024-11-10 17:38:06,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:06,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533813274] [2024-11-10 17:38:06,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:06,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:06,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:06,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:06,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533813274] [2024-11-10 17:38:06,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533813274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:06,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:06,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:38:06,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391212795] [2024-11-10 17:38:06,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:06,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:38:06,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:06,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:38:06,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:38:06,824 INFO L87 Difference]: Start difference. First operand 1601 states and 2191 transitions. Second operand has 3 states, 2 states have (on average 4.5) 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-10 17:38:07,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:07,522 INFO L93 Difference]: Finished difference Result 1882 states and 2536 transitions. [2024-11-10 17:38:07,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:38:07,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) 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-10 17:38:07,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:07,531 INFO L225 Difference]: With dead ends: 1882 [2024-11-10 17:38:07,532 INFO L226 Difference]: Without dead ends: 1882 [2024-11-10 17:38:07,533 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:38:07,535 INFO L432 NwaCegarLoop]: 1142 mSDtfsCounter, 1103 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1111 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:07,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1111 Valid, 1457 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 17:38:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2024-11-10 17:38:07,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1554. [2024-11-10 17:38:07,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1180 states have (on average 1.769491525423729) internal successors, (2088), 1545 states have internal predecessors, (2088), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 17:38:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 2120 transitions. [2024-11-10 17:38:07,568 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 2120 transitions. Word has length 9 [2024-11-10 17:38:07,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:07,568 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 2120 transitions. [2024-11-10 17:38:07,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) 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-10 17:38:07,569 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 2120 transitions. [2024-11-10 17:38:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 17:38:07,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:07,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:07,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 17:38:07,570 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr416REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:07,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:07,570 INFO L85 PathProgramCache]: Analyzing trace with hash -972013479, now seen corresponding path program 1 times [2024-11-10 17:38:07,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:07,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989421791] [2024-11-10 17:38:07,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:07,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:07,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:07,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:07,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989421791] [2024-11-10 17:38:07,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989421791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:07,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:07,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:38:07,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657714446] [2024-11-10 17:38:07,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:07,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:38:07,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:07,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:38:07,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:38:07,681 INFO L87 Difference]: Start difference. First operand 1554 states and 2120 transitions. Second operand has 3 states, 2 states have (on average 4.5) 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-10 17:38:08,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:08,324 INFO L93 Difference]: Finished difference Result 2111 states and 2913 transitions. [2024-11-10 17:38:08,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:38:08,325 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) 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-10 17:38:08,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:08,333 INFO L225 Difference]: With dead ends: 2111 [2024-11-10 17:38:08,333 INFO L226 Difference]: Without dead ends: 2111 [2024-11-10 17:38:08,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:38:08,334 INFO L432 NwaCegarLoop]: 1273 mSDtfsCounter, 892 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 1706 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:08,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 1706 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 17:38:08,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2024-11-10 17:38:08,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 1529. [2024-11-10 17:38:08,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1529 states, 1180 states have (on average 1.7279661016949153) internal successors, (2039), 1520 states have internal predecessors, (2039), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 17:38:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1529 states to 1529 states and 2071 transitions. [2024-11-10 17:38:08,368 INFO L78 Accepts]: Start accepts. Automaton has 1529 states and 2071 transitions. Word has length 9 [2024-11-10 17:38:08,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:08,369 INFO L471 AbstractCegarLoop]: Abstraction has 1529 states and 2071 transitions. [2024-11-10 17:38:08,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) 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-10 17:38:08,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1529 states and 2071 transitions. [2024-11-10 17:38:08,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 17:38:08,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:08,370 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:08,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 17:38:08,370 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:08,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:08,371 INFO L85 PathProgramCache]: Analyzing trace with hash 63560258, now seen corresponding path program 1 times [2024-11-10 17:38:08,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:08,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632270908] [2024-11-10 17:38:08,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:08,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:08,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:08,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:08,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632270908] [2024-11-10 17:38:08,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632270908] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:08,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:08,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:38:08,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775104929] [2024-11-10 17:38:08,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:08,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:38:08,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:08,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:38:08,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:38:08,439 INFO L87 Difference]: Start difference. First operand 1529 states and 2071 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:08,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:08,713 INFO L93 Difference]: Finished difference Result 2737 states and 3633 transitions. [2024-11-10 17:38:08,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:38:08,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2024-11-10 17:38:08,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:08,723 INFO L225 Difference]: With dead ends: 2737 [2024-11-10 17:38:08,723 INFO L226 Difference]: Without dead ends: 2737 [2024-11-10 17:38:08,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:38:08,726 INFO L432 NwaCegarLoop]: 1319 mSDtfsCounter, 1116 mSDsluCounter, 2386 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 3705 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:08,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1124 Valid, 3705 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 17:38:08,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2737 states. [2024-11-10 17:38:08,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2737 to 1532. [2024-11-10 17:38:08,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1183 states have (on average 1.7261200338123415) internal successors, (2042), 1523 states have internal predecessors, (2042), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 17:38:08,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 2074 transitions. [2024-11-10 17:38:08,770 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 2074 transitions. Word has length 13 [2024-11-10 17:38:08,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:08,770 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 2074 transitions. [2024-11-10 17:38:08,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:08,771 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 2074 transitions. [2024-11-10 17:38:08,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 17:38:08,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:08,771 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] [2024-11-10 17:38:08,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 17:38:08,772 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr407REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:08,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:08,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1457343219, now seen corresponding path program 1 times [2024-11-10 17:38:08,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:08,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857053337] [2024-11-10 17:38:08,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:08,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:08,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:08,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:08,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857053337] [2024-11-10 17:38:08,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857053337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:08,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:08,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:38:08,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535899632] [2024-11-10 17:38:08,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:08,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:38:08,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:08,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:38:08,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:38:08,883 INFO L87 Difference]: Start difference. First operand 1532 states and 2074 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:09,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:09,602 INFO L93 Difference]: Finished difference Result 1607 states and 2180 transitions. [2024-11-10 17:38:09,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:38:09,602 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2024-11-10 17:38:09,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:09,609 INFO L225 Difference]: With dead ends: 1607 [2024-11-10 17:38:09,610 INFO L226 Difference]: Without dead ends: 1607 [2024-11-10 17:38:09,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:38:09,611 INFO L432 NwaCegarLoop]: 725 mSDtfsCounter, 1368 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1376 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:09,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1376 Valid, 1322 Invalid, 913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 17:38:09,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2024-11-10 17:38:09,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1509. [2024-11-10 17:38:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1183 states have (on average 1.687235841081995) internal successors, (1996), 1500 states have internal predecessors, (1996), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 17:38:09,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2028 transitions. [2024-11-10 17:38:09,645 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2028 transitions. Word has length 20 [2024-11-10 17:38:09,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:09,646 INFO L471 AbstractCegarLoop]: Abstraction has 1509 states and 2028 transitions. [2024-11-10 17:38:09,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:09,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2028 transitions. [2024-11-10 17:38:09,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-10 17:38:09,646 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:09,647 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] [2024-11-10 17:38:09,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 17:38:09,647 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr408REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:09,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:09,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1457343218, now seen corresponding path program 1 times [2024-11-10 17:38:09,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:09,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953160486] [2024-11-10 17:38:09,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:09,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:09,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:09,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:09,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:09,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953160486] [2024-11-10 17:38:09,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953160486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:09,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:09,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:38:09,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416949015] [2024-11-10 17:38:09,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:09,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:38:09,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:09,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:38:09,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:38:09,724 INFO L87 Difference]: Start difference. First operand 1509 states and 2028 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:09,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:09,811 INFO L93 Difference]: Finished difference Result 1371 states and 1822 transitions. [2024-11-10 17:38:09,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:38:09,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2024-11-10 17:38:09,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:09,817 INFO L225 Difference]: With dead ends: 1371 [2024-11-10 17:38:09,817 INFO L226 Difference]: Without dead ends: 1371 [2024-11-10 17:38:09,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:38:09,820 INFO L432 NwaCegarLoop]: 1000 mSDtfsCounter, 61 mSDsluCounter, 946 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1946 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:09,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1946 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:38:09,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2024-11-10 17:38:09,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1371. [2024-11-10 17:38:09,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1371 states, 1057 states have (on average 1.6934720908230843) internal successors, (1790), 1362 states have internal predecessors, (1790), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 17:38:09,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1371 states to 1371 states and 1822 transitions. [2024-11-10 17:38:09,848 INFO L78 Accepts]: Start accepts. Automaton has 1371 states and 1822 transitions. Word has length 20 [2024-11-10 17:38:09,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:09,848 INFO L471 AbstractCegarLoop]: Abstraction has 1371 states and 1822 transitions. [2024-11-10 17:38:09,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:09,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 1822 transitions. [2024-11-10 17:38:09,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-10 17:38:09,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:09,850 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:09,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 17:38:09,850 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr384REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:09,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:09,851 INFO L85 PathProgramCache]: Analyzing trace with hash -347605167, now seen corresponding path program 1 times [2024-11-10 17:38:09,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:09,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018898037] [2024-11-10 17:38:09,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:09,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:09,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:09,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:09,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:09,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018898037] [2024-11-10 17:38:09,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018898037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:09,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:09,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:38:09,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160184692] [2024-11-10 17:38:09,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:09,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:38:09,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:09,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:38:09,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:38:09,929 INFO L87 Difference]: Start difference. First operand 1371 states and 1822 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:10,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:10,043 INFO L93 Difference]: Finished difference Result 1342 states and 1772 transitions. [2024-11-10 17:38:10,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:38:10,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-10 17:38:10,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:10,049 INFO L225 Difference]: With dead ends: 1342 [2024-11-10 17:38:10,049 INFO L226 Difference]: Without dead ends: 1342 [2024-11-10 17:38:10,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:38:10,050 INFO L432 NwaCegarLoop]: 965 mSDtfsCounter, 41 mSDsluCounter, 1901 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2866 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:10,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2866 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:38:10,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2024-11-10 17:38:10,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1336. [2024-11-10 17:38:10,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1336 states, 1029 states have (on average 1.685131195335277) internal successors, (1734), 1327 states have internal predecessors, (1734), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 17:38:10,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 1766 transitions. [2024-11-10 17:38:10,073 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 1766 transitions. Word has length 22 [2024-11-10 17:38:10,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:10,073 INFO L471 AbstractCegarLoop]: Abstraction has 1336 states and 1766 transitions. [2024-11-10 17:38:10,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:10,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 1766 transitions. [2024-11-10 17:38:10,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-10 17:38:10,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:10,075 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:10,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 17:38:10,075 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr370REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:10,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:10,076 INFO L85 PathProgramCache]: Analyzing trace with hash 341081511, now seen corresponding path program 1 times [2024-11-10 17:38:10,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:10,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233937709] [2024-11-10 17:38:10,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:10,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:10,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:10,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:10,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:10,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233937709] [2024-11-10 17:38:10,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233937709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:10,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:10,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:38:10,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974113031] [2024-11-10 17:38:10,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:10,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:38:10,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:10,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:38:10,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:38:10,259 INFO L87 Difference]: Start difference. First operand 1336 states and 1766 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:11,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:11,117 INFO L93 Difference]: Finished difference Result 2151 states and 2936 transitions. [2024-11-10 17:38:11,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:38:11,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-11-10 17:38:11,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:11,125 INFO L225 Difference]: With dead ends: 2151 [2024-11-10 17:38:11,126 INFO L226 Difference]: Without dead ends: 2151 [2024-11-10 17:38:11,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:38:11,127 INFO L432 NwaCegarLoop]: 804 mSDtfsCounter, 841 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 1886 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:11,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 1886 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 17:38:11,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2151 states. [2024-11-10 17:38:11,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2151 to 1332. [2024-11-10 17:38:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1029 states have (on average 1.6773566569484937) internal successors, (1726), 1323 states have internal predecessors, (1726), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 17:38:11,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1758 transitions. [2024-11-10 17:38:11,159 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1758 transitions. Word has length 36 [2024-11-10 17:38:11,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:11,160 INFO L471 AbstractCegarLoop]: Abstraction has 1332 states and 1758 transitions. [2024-11-10 17:38:11,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:11,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1758 transitions. [2024-11-10 17:38:11,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-10 17:38:11,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:11,162 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:11,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 17:38:11,162 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:11,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:11,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1838242583, now seen corresponding path program 1 times [2024-11-10 17:38:11,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:11,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650359377] [2024-11-10 17:38:11,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:11,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:11,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:11,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:11,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650359377] [2024-11-10 17:38:11,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650359377] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:11,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:11,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:38:11,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176517861] [2024-11-10 17:38:11,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:11,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:38:11,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:11,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:38:11,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:38:11,255 INFO L87 Difference]: Start difference. First operand 1332 states and 1758 transitions. Second operand has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:11,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:11,358 INFO L93 Difference]: Finished difference Result 1332 states and 1750 transitions. [2024-11-10 17:38:11,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:38:11,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 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 71 [2024-11-10 17:38:11,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:11,363 INFO L225 Difference]: With dead ends: 1332 [2024-11-10 17:38:11,363 INFO L226 Difference]: Without dead ends: 1332 [2024-11-10 17:38:11,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:38:11,364 INFO L432 NwaCegarLoop]: 960 mSDtfsCounter, 21 mSDsluCounter, 1888 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2848 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:11,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2848 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:38:11,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1332 states. [2024-11-10 17:38:11,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1332 to 1332. [2024-11-10 17:38:11,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1029 states have (on average 1.6695821185617103) internal successors, (1718), 1323 states have internal predecessors, (1718), 17 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 17:38:11,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1750 transitions. [2024-11-10 17:38:11,383 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1750 transitions. Word has length 71 [2024-11-10 17:38:11,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:11,383 INFO L471 AbstractCegarLoop]: Abstraction has 1332 states and 1750 transitions. [2024-11-10 17:38:11,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.75) internal successors, (71), 4 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:11,383 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1750 transitions. [2024-11-10 17:38:11,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-10 17:38:11,384 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:11,384 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:11,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 17:38:11,385 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:11,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:11,385 INFO L85 PathProgramCache]: Analyzing trace with hash 857820833, now seen corresponding path program 1 times [2024-11-10 17:38:11,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:11,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623187270] [2024-11-10 17:38:11,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:11,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:11,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:11,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623187270] [2024-11-10 17:38:11,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623187270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:11,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:11,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:38:11,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428438635] [2024-11-10 17:38:11,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:11,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:38:11,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:11,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:38:11,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:38:11,531 INFO L87 Difference]: Start difference. First operand 1332 states and 1750 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:11,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:11,672 INFO L93 Difference]: Finished difference Result 1869 states and 2519 transitions. [2024-11-10 17:38:11,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:38:11,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2024-11-10 17:38:11,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:11,678 INFO L225 Difference]: With dead ends: 1869 [2024-11-10 17:38:11,679 INFO L226 Difference]: Without dead ends: 1869 [2024-11-10 17:38:11,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:38:11,679 INFO L432 NwaCegarLoop]: 1242 mSDtfsCounter, 367 mSDsluCounter, 930 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 2172 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:11,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 2172 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:38:11,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2024-11-10 17:38:11,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1811. [2024-11-10 17:38:11,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1811 states, 1498 states have (on average 1.644192256341789) internal successors, (2463), 1802 states have internal predecessors, (2463), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 17:38:11,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 2515 transitions. [2024-11-10 17:38:11,705 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 2515 transitions. Word has length 79 [2024-11-10 17:38:11,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:11,706 INFO L471 AbstractCegarLoop]: Abstraction has 1811 states and 2515 transitions. [2024-11-10 17:38:11,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:11,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 2515 transitions. [2024-11-10 17:38:11,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 17:38:11,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:11,707 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:11,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 17:38:11,708 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr319REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:11,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:11,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1385662764, now seen corresponding path program 1 times [2024-11-10 17:38:11,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:11,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089354567] [2024-11-10 17:38:11,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:11,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:11,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:11,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:11,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089354567] [2024-11-10 17:38:11,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089354567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:11,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:11,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:38:11,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805164282] [2024-11-10 17:38:11,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:11,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:38:11,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:11,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:38:11,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:38:11,994 INFO L87 Difference]: Start difference. First operand 1811 states and 2515 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:12,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:12,612 INFO L93 Difference]: Finished difference Result 1810 states and 2513 transitions. [2024-11-10 17:38:12,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:38:12,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 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 87 [2024-11-10 17:38:12,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:12,619 INFO L225 Difference]: With dead ends: 1810 [2024-11-10 17:38:12,619 INFO L226 Difference]: Without dead ends: 1810 [2024-11-10 17:38:12,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:38:12,620 INFO L432 NwaCegarLoop]: 971 mSDtfsCounter, 2 mSDsluCounter, 1919 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2890 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:12,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2890 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 17:38:12,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2024-11-10 17:38:12,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1810. [2024-11-10 17:38:12,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1498 states have (on average 1.6428571428571428) internal successors, (2461), 1801 states have internal predecessors, (2461), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 17:38:12,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2513 transitions. [2024-11-10 17:38:12,668 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2513 transitions. Word has length 87 [2024-11-10 17:38:12,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:12,669 INFO L471 AbstractCegarLoop]: Abstraction has 1810 states and 2513 transitions. [2024-11-10 17:38:12,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:12,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2513 transitions. [2024-11-10 17:38:12,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-10 17:38:12,673 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:12,673 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:12,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 17:38:12,673 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr320REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:12,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:12,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1385662765, now seen corresponding path program 1 times [2024-11-10 17:38:12,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:12,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301860406] [2024-11-10 17:38:12,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:12,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:12,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:13,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:13,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:13,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301860406] [2024-11-10 17:38:13,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301860406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:13,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:13,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:38:13,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397634348] [2024-11-10 17:38:13,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:13,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:38:13,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:13,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:38:13,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:38:13,211 INFO L87 Difference]: Start difference. First operand 1810 states and 2513 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:13,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:13,968 INFO L93 Difference]: Finished difference Result 1809 states and 2511 transitions. [2024-11-10 17:38:13,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:38:13,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 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 87 [2024-11-10 17:38:13,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:13,974 INFO L225 Difference]: With dead ends: 1809 [2024-11-10 17:38:13,974 INFO L226 Difference]: Without dead ends: 1809 [2024-11-10 17:38:13,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:38:13,975 INFO L432 NwaCegarLoop]: 971 mSDtfsCounter, 1 mSDsluCounter, 1860 mSDsCounter, 0 mSdLazyCounter, 1185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2831 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:13,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2831 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1185 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 17:38:13,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2024-11-10 17:38:13,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1809. [2024-11-10 17:38:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1809 states, 1496 states have (on average 1.643716577540107) internal successors, (2459), 1800 states have internal predecessors, (2459), 27 states have call successors, (27), 3 states have call predecessors, (27), 2 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 17:38:13,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1809 states to 1809 states and 2511 transitions. [2024-11-10 17:38:13,998 INFO L78 Accepts]: Start accepts. Automaton has 1809 states and 2511 transitions. Word has length 87 [2024-11-10 17:38:13,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:13,999 INFO L471 AbstractCegarLoop]: Abstraction has 1809 states and 2511 transitions. [2024-11-10 17:38:13,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:13,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1809 states and 2511 transitions. [2024-11-10 17:38:14,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 17:38:14,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:14,000 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:14,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 17:38:14,000 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:14,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:14,001 INFO L85 PathProgramCache]: Analyzing trace with hash 404855753, now seen corresponding path program 1 times [2024-11-10 17:38:14,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:14,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661847412] [2024-11-10 17:38:14,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:14,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:14,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:38:14,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:14,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:14,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:14,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661847412] [2024-11-10 17:38:14,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661847412] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:14,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:14,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:38:14,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120385365] [2024-11-10 17:38:14,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:14,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:38:14,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:14,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:38:14,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:38:14,266 INFO L87 Difference]: Start difference. First operand 1809 states and 2511 transitions. Second operand has 7 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:38:15,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:15,332 INFO L93 Difference]: Finished difference Result 1827 states and 2537 transitions. [2024-11-10 17:38:15,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 17:38:15,332 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-10 17:38:15,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:15,338 INFO L225 Difference]: With dead ends: 1827 [2024-11-10 17:38:15,339 INFO L226 Difference]: Without dead ends: 1827 [2024-11-10 17:38:15,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 17:38:15,339 INFO L432 NwaCegarLoop]: 956 mSDtfsCounter, 17 mSDsluCounter, 3476 mSDsCounter, 0 mSdLazyCounter, 1583 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4432 SdHoareTripleChecker+Invalid, 1593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:15,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4432 Invalid, 1593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1583 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 17:38:15,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2024-11-10 17:38:15,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1818. [2024-11-10 17:38:15,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1504 states have (on average 1.6422872340425532) internal successors, (2470), 1807 states have internal predecessors, (2470), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (30), 11 states have call predecessors, (30), 25 states have call successors, (30) [2024-11-10 17:38:15,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 2527 transitions. [2024-11-10 17:38:15,368 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 2527 transitions. Word has length 95 [2024-11-10 17:38:15,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:15,369 INFO L471 AbstractCegarLoop]: Abstraction has 1818 states and 2527 transitions. [2024-11-10 17:38:15,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:38:15,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2527 transitions. [2024-11-10 17:38:15,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 17:38:15,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:15,370 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:15,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 17:38:15,370 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:15,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:15,371 INFO L85 PathProgramCache]: Analyzing trace with hash 404855754, now seen corresponding path program 1 times [2024-11-10 17:38:15,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:15,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938879535] [2024-11-10 17:38:15,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:15,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:15,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:38:15,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:15,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:15,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:15,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938879535] [2024-11-10 17:38:15,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938879535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:15,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:15,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:38:15,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942804153] [2024-11-10 17:38:15,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:15,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:38:15,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:15,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:38:15,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:38:15,903 INFO L87 Difference]: Start difference. First operand 1818 states and 2527 transitions. Second operand has 7 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:38:16,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:16,974 INFO L93 Difference]: Finished difference Result 1818 states and 2525 transitions. [2024-11-10 17:38:16,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:38:16,975 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-10 17:38:16,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:16,981 INFO L225 Difference]: With dead ends: 1818 [2024-11-10 17:38:16,981 INFO L226 Difference]: Without dead ends: 1818 [2024-11-10 17:38:16,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 17:38:16,982 INFO L432 NwaCegarLoop]: 960 mSDtfsCounter, 12 mSDsluCounter, 3455 mSDsCounter, 0 mSdLazyCounter, 1579 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4415 SdHoareTripleChecker+Invalid, 1587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:16,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4415 Invalid, 1587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1579 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 17:38:16,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1818 states. [2024-11-10 17:38:17,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1818 to 1818. [2024-11-10 17:38:17,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1818 states, 1504 states have (on average 1.6409574468085106) internal successors, (2468), 1807 states have internal predecessors, (2468), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (30), 11 states have call predecessors, (30), 25 states have call successors, (30) [2024-11-10 17:38:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 2525 transitions. [2024-11-10 17:38:17,014 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 2525 transitions. Word has length 95 [2024-11-10 17:38:17,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:17,015 INFO L471 AbstractCegarLoop]: Abstraction has 1818 states and 2525 transitions. [2024-11-10 17:38:17,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.5) internal successors, (93), 6 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:38:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2525 transitions. [2024-11-10 17:38:17,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 17:38:17,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:17,016 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:17,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 17:38:17,016 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr315REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:17,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:17,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1720374036, now seen corresponding path program 1 times [2024-11-10 17:38:17,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:17,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589345183] [2024-11-10 17:38:17,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:17,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:17,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:38:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:17,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:17,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:17,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589345183] [2024-11-10 17:38:17,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589345183] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:38:17,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374330754] [2024-11-10 17:38:17,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:17,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:38:17,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:38:17,566 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:38:17,567 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 17:38:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:17,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 17:38:17,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:38:17,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:38:17,999 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 17:38:18,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-10 17:38:18,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:38:18,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-10 17:38:18,301 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:38:18,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:38:18,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 17:38:18,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:18,376 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:38:18,407 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_592 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_592) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-10 17:38:18,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374330754] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:38:18,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:38:18,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-10 17:38:18,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653426568] [2024-11-10 17:38:18,409 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:38:18,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 17:38:18,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:18,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 17:38:18,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=292, Unknown=1, NotChecked=34, Total=380 [2024-11-10 17:38:18,411 INFO L87 Difference]: Start difference. First operand 1818 states and 2525 transitions. Second operand has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 17:38:21,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:21,048 INFO L93 Difference]: Finished difference Result 1825 states and 2531 transitions. [2024-11-10 17:38:21,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:38:21,048 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2024-11-10 17:38:21,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:21,053 INFO L225 Difference]: With dead ends: 1825 [2024-11-10 17:38:21,053 INFO L226 Difference]: Without dead ends: 1825 [2024-11-10 17:38:21,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=469, Unknown=1, NotChecked=44, Total=600 [2024-11-10 17:38:21,055 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 907 mSDsluCounter, 7221 mSDsCounter, 0 mSdLazyCounter, 5179 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 7844 SdHoareTripleChecker+Invalid, 5201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:21,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 7844 Invalid, 5201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 5179 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-10 17:38:21,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1825 states. [2024-11-10 17:38:21,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1825 to 1822. [2024-11-10 17:38:21,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1822 states, 1508 states have (on average 1.6385941644562334) internal successors, (2471), 1810 states have internal predecessors, (2471), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-10 17:38:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1822 states to 1822 states and 2525 transitions. [2024-11-10 17:38:21,100 INFO L78 Accepts]: Start accepts. Automaton has 1822 states and 2525 transitions. Word has length 96 [2024-11-10 17:38:21,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:21,100 INFO L471 AbstractCegarLoop]: Abstraction has 1822 states and 2525 transitions. [2024-11-10 17:38:21,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 17:38:21,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1822 states and 2525 transitions. [2024-11-10 17:38:21,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 17:38:21,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:21,102 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:21,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 17:38:21,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-10 17:38:21,307 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:21,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:21,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1720374037, now seen corresponding path program 1 times [2024-11-10 17:38:21,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:21,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693396473] [2024-11-10 17:38:21,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:21,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:22,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:38:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:22,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:22,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693396473] [2024-11-10 17:38:22,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693396473] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:38:22,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380774106] [2024-11-10 17:38:22,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:22,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:38:22,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:38:22,117 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:38:22,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 17:38:22,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:22,335 INFO L255 TraceCheckSpWp]: Trace formula consists of 456 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 17:38:22,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:38:22,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:38:22,471 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:38:22,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 17:38:22,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 17:38:22,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:38:22,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 17:38:22,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-10 17:38:22,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 17:38:22,695 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:38:22,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 17:38:22,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:38:22,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 17:38:22,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 17:38:22,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:22,765 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:38:22,863 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_742 (Array Int Int)) (v_ArrVal_741 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_741) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_742) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_741 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_741) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))))) is different from false [2024-11-10 17:38:22,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380774106] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:38:22,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:38:22,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-10 17:38:22,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443739987] [2024-11-10 17:38:22,866 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:38:22,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 17:38:22,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:22,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 17:38:22,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2024-11-10 17:38:22,869 INFO L87 Difference]: Start difference. First operand 1822 states and 2525 transitions. Second operand has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 17:38:25,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:25,892 INFO L93 Difference]: Finished difference Result 1824 states and 2529 transitions. [2024-11-10 17:38:25,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 17:38:25,893 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2024-11-10 17:38:25,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:25,897 INFO L225 Difference]: With dead ends: 1824 [2024-11-10 17:38:25,897 INFO L226 Difference]: Without dead ends: 1824 [2024-11-10 17:38:25,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=550, Unknown=1, NotChecked=48, Total=702 [2024-11-10 17:38:25,898 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 905 mSDsluCounter, 5721 mSDsCounter, 0 mSdLazyCounter, 5680 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 914 SdHoareTripleChecker+Valid, 6347 SdHoareTripleChecker+Invalid, 5703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:25,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [914 Valid, 6347 Invalid, 5703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 5680 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-10 17:38:25,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2024-11-10 17:38:25,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1812. [2024-11-10 17:38:25,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1812 states, 1500 states have (on average 1.64) internal successors, (2460), 1802 states have internal predecessors, (2460), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 17:38:25,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1812 states to 1812 states and 2512 transitions. [2024-11-10 17:38:25,919 INFO L78 Accepts]: Start accepts. Automaton has 1812 states and 2512 transitions. Word has length 96 [2024-11-10 17:38:25,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:25,920 INFO L471 AbstractCegarLoop]: Abstraction has 1812 states and 2512 transitions. [2024-11-10 17:38:25,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.4375) internal successors, (151), 18 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 17:38:25,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1812 states and 2512 transitions. [2024-11-10 17:38:25,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 17:38:25,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:25,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:25,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 17:38:26,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-10 17:38:26,126 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:26,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:26,126 INFO L85 PathProgramCache]: Analyzing trace with hash 790489874, now seen corresponding path program 1 times [2024-11-10 17:38:26,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:26,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47000918] [2024-11-10 17:38:26,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:26,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:26,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:38:26,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:26,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:26,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:26,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47000918] [2024-11-10 17:38:26,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47000918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:26,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:26,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 17:38:26,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105512452] [2024-11-10 17:38:26,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:26,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 17:38:26,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:26,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 17:38:26,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-10 17:38:26,736 INFO L87 Difference]: Start difference. First operand 1812 states and 2512 transitions. Second operand has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:38:28,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:28,312 INFO L93 Difference]: Finished difference Result 1831 states and 2537 transitions. [2024-11-10 17:38:28,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 17:38:28,313 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-10 17:38:28,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:28,317 INFO L225 Difference]: With dead ends: 1831 [2024-11-10 17:38:28,317 INFO L226 Difference]: Without dead ends: 1831 [2024-11-10 17:38:28,317 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-10 17:38:28,318 INFO L432 NwaCegarLoop]: 623 mSDtfsCounter, 940 mSDsluCounter, 4818 mSDsCounter, 0 mSdLazyCounter, 3629 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 5441 SdHoareTripleChecker+Invalid, 3648 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:28,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 5441 Invalid, 3648 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3629 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 17:38:28,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2024-11-10 17:38:28,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1827. [2024-11-10 17:38:28,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1827 states, 1514 states have (on average 1.6360634081902246) internal successors, (2477), 1815 states have internal predecessors, (2477), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-10 17:38:28,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2531 transitions. [2024-11-10 17:38:28,347 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2531 transitions. Word has length 98 [2024-11-10 17:38:28,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:28,348 INFO L471 AbstractCegarLoop]: Abstraction has 1827 states and 2531 transitions. [2024-11-10 17:38:28,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.0) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:38:28,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2531 transitions. [2024-11-10 17:38:28,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 17:38:28,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:28,349 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:28,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 17:38:28,350 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:28,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:28,350 INFO L85 PathProgramCache]: Analyzing trace with hash 790489875, now seen corresponding path program 1 times [2024-11-10 17:38:28,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:28,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032032423] [2024-11-10 17:38:28,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:28,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:28,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:29,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:38:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:29,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:29,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:29,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032032423] [2024-11-10 17:38:29,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032032423] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:29,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:29,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 17:38:29,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871537644] [2024-11-10 17:38:29,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:29,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 17:38:29,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:29,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 17:38:29,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-10 17:38:29,063 INFO L87 Difference]: Start difference. First operand 1827 states and 2531 transitions. Second operand has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:38:30,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:30,569 INFO L93 Difference]: Finished difference Result 1830 states and 2535 transitions. [2024-11-10 17:38:30,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 17:38:30,569 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-10 17:38:30,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:30,572 INFO L225 Difference]: With dead ends: 1830 [2024-11-10 17:38:30,572 INFO L226 Difference]: Without dead ends: 1830 [2024-11-10 17:38:30,573 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-10 17:38:30,574 INFO L432 NwaCegarLoop]: 627 mSDtfsCounter, 914 mSDsluCounter, 3235 mSDsCounter, 0 mSdLazyCounter, 3178 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 3862 SdHoareTripleChecker+Invalid, 3195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:30,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 3862 Invalid, 3195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3178 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-10 17:38:30,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2024-11-10 17:38:30,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1827. [2024-11-10 17:38:30,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1827 states, 1514 states have (on average 1.6347424042272127) internal successors, (2475), 1815 states have internal predecessors, (2475), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-10 17:38:30,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1827 states to 1827 states and 2529 transitions. [2024-11-10 17:38:30,596 INFO L78 Accepts]: Start accepts. Automaton has 1827 states and 2529 transitions. Word has length 98 [2024-11-10 17:38:30,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:30,597 INFO L471 AbstractCegarLoop]: Abstraction has 1827 states and 2529 transitions. [2024-11-10 17:38:30,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.727272727272727) internal successors, (96), 11 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:38:30,597 INFO L276 IsEmpty]: Start isEmpty. Operand 1827 states and 2529 transitions. [2024-11-10 17:38:30,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 17:38:30,598 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:30,598 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:30,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 17:38:30,598 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr311REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:30,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:30,599 INFO L85 PathProgramCache]: Analyzing trace with hash -180917273, now seen corresponding path program 1 times [2024-11-10 17:38:30,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:30,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698009232] [2024-11-10 17:38:30,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:30,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:31,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:38:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:31,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:31,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:31,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698009232] [2024-11-10 17:38:31,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698009232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:38:31,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265592519] [2024-11-10 17:38:31,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:31,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:38:31,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:38:31,176 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:38:31,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 17:38:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:31,401 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 17:38:31,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:38:31,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:38:31,542 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 17:38:31,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-10 17:38:31,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:38:31,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-10 17:38:31,797 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:38:31,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:38:31,883 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:38:31,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:38:31,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 17:38:31,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:31,940 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:38:31,950 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1029 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-10 17:38:31,955 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1029 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1029) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-10 17:38:32,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265592519] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:38:32,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:38:32,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-10 17:38:32,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407868972] [2024-11-10 17:38:32,028 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:38:32,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 17:38:32,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:32,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 17:38:32,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=419, Unknown=20, NotChecked=86, Total=600 [2024-11-10 17:38:32,030 INFO L87 Difference]: Start difference. First operand 1827 states and 2529 transitions. Second operand has 22 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 17:38:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:34,075 INFO L93 Difference]: Finished difference Result 1829 states and 2533 transitions. [2024-11-10 17:38:34,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:38:34,076 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 99 [2024-11-10 17:38:34,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:34,079 INFO L225 Difference]: With dead ends: 1829 [2024-11-10 17:38:34,079 INFO L226 Difference]: Without dead ends: 1829 [2024-11-10 17:38:34,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=102, Invalid=586, Unknown=22, NotChecked=102, Total=812 [2024-11-10 17:38:34,080 INFO L432 NwaCegarLoop]: 622 mSDtfsCounter, 902 mSDsluCounter, 6571 mSDsCounter, 0 mSdLazyCounter, 4736 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 7193 SdHoareTripleChecker+Invalid, 4755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:34,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 7193 Invalid, 4755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4736 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-10 17:38:34,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1829 states. [2024-11-10 17:38:34,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1829 to 1826. [2024-11-10 17:38:34,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1826 states, 1514 states have (on average 1.6334214002642007) internal successors, (2473), 1814 states have internal predecessors, (2473), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-10 17:38:34,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 2527 transitions. [2024-11-10 17:38:34,104 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 2527 transitions. Word has length 99 [2024-11-10 17:38:34,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:34,104 INFO L471 AbstractCegarLoop]: Abstraction has 1826 states and 2527 transitions. [2024-11-10 17:38:34,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.263157894736842) internal successors, (157), 21 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 17:38:34,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 2527 transitions. [2024-11-10 17:38:34,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 17:38:34,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:34,106 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:34,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 17:38:34,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:38:34,310 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:34,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:34,311 INFO L85 PathProgramCache]: Analyzing trace with hash -180917272, now seen corresponding path program 1 times [2024-11-10 17:38:34,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:34,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855145336] [2024-11-10 17:38:34,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:34,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:35,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:38:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:35,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:35,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:35,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855145336] [2024-11-10 17:38:35,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855145336] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:38:35,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680487824] [2024-11-10 17:38:35,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:35,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:38:35,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:38:35,171 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:38:35,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 17:38:35,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:35,404 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-10 17:38:35,411 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:38:35,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:38:35,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 17:38:35,530 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:38:35,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 17:38:35,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 17:38:35,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:38:35,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-10 17:38:35,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 17:38:35,758 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:38:35,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 17:38:35,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:38:35,844 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:38:35,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 17:38:35,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:38:35,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 17:38:35,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 17:38:35,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:35,896 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:38:35,959 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1189 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1189 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1190) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-10 17:38:35,971 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1189 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1189 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1190) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-10 17:38:36,026 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1195) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1190 (Array Int Int)) (v_ArrVal_1189 (Array Int Int)) (v_ArrVal_1196 (Array Int Int)) (v_ArrVal_1195 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1196))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1195) .cse1 v_ArrVal_1189) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1190) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-10 17:38:36,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680487824] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:38:36,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:38:36,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-10 17:38:36,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006756620] [2024-11-10 17:38:36,029 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:38:36,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 17:38:36,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:36,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 17:38:36,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=438, Unknown=3, NotChecked=132, Total=650 [2024-11-10 17:38:36,030 INFO L87 Difference]: Start difference. First operand 1826 states and 2527 transitions. Second operand has 21 states, 18 states have (on average 8.722222222222221) internal successors, (157), 20 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 17:38:39,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:39,027 INFO L93 Difference]: Finished difference Result 1828 states and 2531 transitions. [2024-11-10 17:38:39,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 17:38:39,028 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.722222222222221) internal successors, (157), 20 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 99 [2024-11-10 17:38:39,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:39,031 INFO L225 Difference]: With dead ends: 1828 [2024-11-10 17:38:39,031 INFO L226 Difference]: Without dead ends: 1828 [2024-11-10 17:38:39,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=694, Unknown=3, NotChecked=168, Total=992 [2024-11-10 17:38:39,032 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 902 mSDsluCounter, 6649 mSDsCounter, 0 mSdLazyCounter, 6773 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 7274 SdHoareTripleChecker+Invalid, 6796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 6773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:39,032 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 7274 Invalid, 6796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 6773 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-10 17:38:39,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2024-11-10 17:38:39,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 1810. [2024-11-10 17:38:39,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1810 states, 1500 states have (on average 1.6373333333333333) internal successors, (2456), 1800 states have internal predecessors, (2456), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 17:38:39,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1810 states to 1810 states and 2508 transitions. [2024-11-10 17:38:39,056 INFO L78 Accepts]: Start accepts. Automaton has 1810 states and 2508 transitions. Word has length 99 [2024-11-10 17:38:39,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:39,056 INFO L471 AbstractCegarLoop]: Abstraction has 1810 states and 2508 transitions. [2024-11-10 17:38:39,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.722222222222221) internal successors, (157), 20 states have internal predecessors, (157), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 17:38:39,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2508 transitions. [2024-11-10 17:38:39,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 17:38:39,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:39,057 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:39,077 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 17:38:39,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:38:39,262 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:39,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:39,262 INFO L85 PathProgramCache]: Analyzing trace with hash 179064834, now seen corresponding path program 1 times [2024-11-10 17:38:39,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:39,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443684612] [2024-11-10 17:38:39,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:39,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:39,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:38:39,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:39,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:39,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:39,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443684612] [2024-11-10 17:38:39,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443684612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:39,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:39,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 17:38:39,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424478560] [2024-11-10 17:38:39,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:39,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 17:38:39,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:39,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 17:38:39,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-10 17:38:39,970 INFO L87 Difference]: Start difference. First operand 1810 states and 2508 transitions. Second operand has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 14 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:38:41,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:41,965 INFO L93 Difference]: Finished difference Result 1835 states and 2539 transitions. [2024-11-10 17:38:41,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:38:41,966 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 14 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2024-11-10 17:38:41,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:41,969 INFO L225 Difference]: With dead ends: 1835 [2024-11-10 17:38:41,969 INFO L226 Difference]: Without dead ends: 1835 [2024-11-10 17:38:41,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-10 17:38:41,970 INFO L432 NwaCegarLoop]: 622 mSDtfsCounter, 935 mSDsluCounter, 6018 mSDsCounter, 0 mSdLazyCounter, 4420 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 944 SdHoareTripleChecker+Valid, 6640 SdHoareTripleChecker+Invalid, 4438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:41,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [944 Valid, 6640 Invalid, 4438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4420 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 17:38:41,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2024-11-10 17:38:41,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1831. [2024-11-10 17:38:41,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1831 states, 1520 states have (on average 1.630921052631579) internal successors, (2479), 1819 states have internal predecessors, (2479), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-10 17:38:41,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 2533 transitions. [2024-11-10 17:38:41,988 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 2533 transitions. Word has length 101 [2024-11-10 17:38:41,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:41,988 INFO L471 AbstractCegarLoop]: Abstraction has 1831 states and 2533 transitions. [2024-11-10 17:38:41,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 14 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:38:41,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2533 transitions. [2024-11-10 17:38:41,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-10 17:38:41,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:41,990 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:41,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 17:38:41,990 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:41,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:41,990 INFO L85 PathProgramCache]: Analyzing trace with hash 179064835, now seen corresponding path program 1 times [2024-11-10 17:38:41,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:41,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198781076] [2024-11-10 17:38:41,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:41,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:42,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:42,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:38:42,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:42,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:42,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:42,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198781076] [2024-11-10 17:38:42,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198781076] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:42,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:42,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 17:38:42,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693336071] [2024-11-10 17:38:42,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:42,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 17:38:42,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:42,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 17:38:42,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-10 17:38:42,736 INFO L87 Difference]: Start difference. First operand 1831 states and 2533 transitions. Second operand has 13 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:38:44,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:44,322 INFO L93 Difference]: Finished difference Result 1834 states and 2537 transitions. [2024-11-10 17:38:44,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 17:38:44,322 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 101 [2024-11-10 17:38:44,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:44,325 INFO L225 Difference]: With dead ends: 1834 [2024-11-10 17:38:44,325 INFO L226 Difference]: Without dead ends: 1834 [2024-11-10 17:38:44,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-10 17:38:44,326 INFO L432 NwaCegarLoop]: 626 mSDtfsCounter, 940 mSDsluCounter, 3100 mSDsCounter, 0 mSdLazyCounter, 3321 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 949 SdHoareTripleChecker+Valid, 3726 SdHoareTripleChecker+Invalid, 3347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:44,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [949 Valid, 3726 Invalid, 3347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3321 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-10 17:38:44,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1834 states. [2024-11-10 17:38:44,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1834 to 1831. [2024-11-10 17:38:44,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1831 states, 1520 states have (on average 1.6296052631578948) internal successors, (2477), 1819 states have internal predecessors, (2477), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-10 17:38:44,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1831 states to 1831 states and 2531 transitions. [2024-11-10 17:38:44,345 INFO L78 Accepts]: Start accepts. Automaton has 1831 states and 2531 transitions. Word has length 101 [2024-11-10 17:38:44,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:44,345 INFO L471 AbstractCegarLoop]: Abstraction has 1831 states and 2531 transitions. [2024-11-10 17:38:44,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.25) internal successors, (99), 12 states have internal predecessors, (99), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:38:44,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1831 states and 2531 transitions. [2024-11-10 17:38:44,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 17:38:44,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:44,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:44,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 17:38:44,347 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr307REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:44,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:44,347 INFO L85 PathProgramCache]: Analyzing trace with hash 478389005, now seen corresponding path program 1 times [2024-11-10 17:38:44,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:44,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687362595] [2024-11-10 17:38:44,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:44,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:44,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:38:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:44,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:44,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:44,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687362595] [2024-11-10 17:38:44,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687362595] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:38:44,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995434978] [2024-11-10 17:38:44,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:44,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:38:44,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:38:44,949 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:38:44,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 17:38:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:45,194 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 17:38:45,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:38:45,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:38:45,335 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:38:45,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 17:38:45,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:38:45,414 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:38:45,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-10 17:38:45,444 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:38:45,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-10 17:38:45,484 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:38:45,484 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:38:45,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 17:38:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:45,501 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:38:45,516 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-10 17:38:45,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-10 17:38:45,617 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1510 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1510) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-10 17:38:45,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995434978] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:38:45,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:38:45,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 19 [2024-11-10 17:38:45,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784745345] [2024-11-10 17:38:45,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:38:45,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 17:38:45,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:45,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 17:38:45,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=387, Unknown=15, NotChecked=40, Total=506 [2024-11-10 17:38:45,621 INFO L87 Difference]: Start difference. First operand 1831 states and 2531 transitions. Second operand has 20 states, 18 states have (on average 8.666666666666666) internal successors, (156), 19 states have internal predecessors, (156), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:38:47,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:47,409 INFO L93 Difference]: Finished difference Result 1833 states and 2535 transitions. [2024-11-10 17:38:47,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 17:38:47,409 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 8.666666666666666) internal successors, (156), 19 states have internal predecessors, (156), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2024-11-10 17:38:47,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:47,413 INFO L225 Difference]: With dead ends: 1833 [2024-11-10 17:38:47,413 INFO L226 Difference]: Without dead ends: 1833 [2024-11-10 17:38:47,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 103 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=784, Unknown=17, NotChecked=58, Total=992 [2024-11-10 17:38:47,414 INFO L432 NwaCegarLoop]: 622 mSDtfsCounter, 904 mSDsluCounter, 6009 mSDsCounter, 0 mSdLazyCounter, 4412 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 913 SdHoareTripleChecker+Valid, 6631 SdHoareTripleChecker+Invalid, 4440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 4412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:47,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [913 Valid, 6631 Invalid, 4440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 4412 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 17:38:47,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1833 states. [2024-11-10 17:38:47,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1833 to 1830. [2024-11-10 17:38:47,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1830 states, 1520 states have (on average 1.6282894736842106) internal successors, (2475), 1818 states have internal predecessors, (2475), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-10 17:38:47,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1830 states to 1830 states and 2529 transitions. [2024-11-10 17:38:47,435 INFO L78 Accepts]: Start accepts. Automaton has 1830 states and 2529 transitions. Word has length 102 [2024-11-10 17:38:47,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:47,435 INFO L471 AbstractCegarLoop]: Abstraction has 1830 states and 2529 transitions. [2024-11-10 17:38:47,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 8.666666666666666) internal successors, (156), 19 states have internal predecessors, (156), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:38:47,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1830 states and 2529 transitions. [2024-11-10 17:38:47,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 17:38:47,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:47,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:47,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-10 17:38:47,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-10 17:38:47,638 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:47,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:47,639 INFO L85 PathProgramCache]: Analyzing trace with hash 478389006, now seen corresponding path program 1 times [2024-11-10 17:38:47,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:47,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050201856] [2024-11-10 17:38:47,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:47,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:48,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:38:48,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:48,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:48,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:48,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050201856] [2024-11-10 17:38:48,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050201856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:38:48,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434176119] [2024-11-10 17:38:48,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:48,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:38:48,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:38:48,545 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:38:48,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 17:38:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:48,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 506 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-10 17:38:48,800 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:38:48,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:38:48,899 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:38:48,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 17:38:48,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 17:38:48,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:38:48,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 17:38:49,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-10 17:38:49,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 17:38:49,109 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:38:49,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 17:38:49,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:38:49,172 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:38:49,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 17:38:49,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:38:49,231 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:38:49,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 17:38:49,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:38:49,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 17:38:49,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 17:38:49,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:49,273 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:38:49,323 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1681 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1681) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1681 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1681) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_1682) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-10 17:38:49,331 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1681 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1681) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_1682) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1681 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_1681) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-10 17:38:49,354 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1680 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1680))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1679) .cse0 v_ArrVal_1681) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1682) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1680 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1679) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1681) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-11-10 17:38:49,485 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1687 (Array Int Int)) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1680 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1688))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1687) .cse0 v_ArrVal_1679) (select (select (store .cse1 .cse0 v_ArrVal_1680) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1681))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1679 (Array Int Int)) (v_ArrVal_1688 (Array Int Int)) (v_ArrVal_1687 (Array Int Int)) (v_ArrVal_1682 (Array Int Int)) (v_ArrVal_1681 (Array Int Int)) (v_ArrVal_1680 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1688))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1680))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1687) .cse3 v_ArrVal_1679) .cse4 v_ArrVal_1681) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1682) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-10 17:38:49,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434176119] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:38:49,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:38:49,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2024-11-10 17:38:49,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053798146] [2024-11-10 17:38:49,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:38:49,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-10 17:38:49,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:49,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 17:38:49,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=559, Unknown=9, NotChecked=204, Total=870 [2024-11-10 17:38:49,490 INFO L87 Difference]: Start difference. First operand 1830 states and 2529 transitions. Second operand has 23 states, 20 states have (on average 8.15) internal successors, (163), 22 states have internal predecessors, (163), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 17:38:52,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:52,995 INFO L93 Difference]: Finished difference Result 1832 states and 2533 transitions. [2024-11-10 17:38:52,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:38:52,995 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 8.15) internal successors, (163), 22 states have internal predecessors, (163), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 102 [2024-11-10 17:38:52,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:52,998 INFO L225 Difference]: With dead ends: 1832 [2024-11-10 17:38:52,998 INFO L226 Difference]: Without dead ends: 1832 [2024-11-10 17:38:52,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=900, Unknown=9, NotChecked=260, Total=1332 [2024-11-10 17:38:52,999 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 899 mSDsluCounter, 7624 mSDsCounter, 0 mSdLazyCounter, 7779 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 8248 SdHoareTripleChecker+Invalid, 7802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 7779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:53,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 8248 Invalid, 7802 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 7779 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-10 17:38:53,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2024-11-10 17:38:53,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1808. [2024-11-10 17:38:53,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1808 states, 1500 states have (on average 1.6346666666666667) internal successors, (2452), 1798 states have internal predecessors, (2452), 27 states have call successors, (27), 4 states have call predecessors, (27), 3 states have return successors, (25), 9 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 17:38:53,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1808 states to 1808 states and 2504 transitions. [2024-11-10 17:38:53,022 INFO L78 Accepts]: Start accepts. Automaton has 1808 states and 2504 transitions. Word has length 102 [2024-11-10 17:38:53,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:53,023 INFO L471 AbstractCegarLoop]: Abstraction has 1808 states and 2504 transitions. [2024-11-10 17:38:53,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 8.15) internal successors, (163), 22 states have internal predecessors, (163), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 17:38:53,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1808 states and 2504 transitions. [2024-11-10 17:38:53,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-10 17:38:53,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:53,024 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:53,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-10 17:38:53,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:38:53,229 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr303REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:53,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:53,229 INFO L85 PathProgramCache]: Analyzing trace with hash 171993579, now seen corresponding path program 1 times [2024-11-10 17:38:53,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:53,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469675332] [2024-11-10 17:38:53,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:53,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:53,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:53,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:38:53,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:53,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:53,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:53,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469675332] [2024-11-10 17:38:53,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469675332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:53,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:53,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 17:38:53,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063890074] [2024-11-10 17:38:53,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:53,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 17:38:53,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:53,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 17:38:53,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-10 17:38:53,903 INFO L87 Difference]: Start difference. First operand 1808 states and 2504 transitions. Second operand has 16 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:38:56,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:56,047 INFO L93 Difference]: Finished difference Result 1839 states and 2541 transitions. [2024-11-10 17:38:56,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 17:38:56,047 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2024-11-10 17:38:56,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:56,050 INFO L225 Difference]: With dead ends: 1839 [2024-11-10 17:38:56,050 INFO L226 Difference]: Without dead ends: 1839 [2024-11-10 17:38:56,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-10 17:38:56,051 INFO L432 NwaCegarLoop]: 621 mSDtfsCounter, 917 mSDsluCounter, 7174 mSDsCounter, 0 mSdLazyCounter, 5221 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 926 SdHoareTripleChecker+Valid, 7795 SdHoareTripleChecker+Invalid, 5239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 5221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:56,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [926 Valid, 7795 Invalid, 5239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 5221 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-10 17:38:56,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1839 states. [2024-11-10 17:38:56,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1839 to 1835. [2024-11-10 17:38:56,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1526 states have (on average 1.625819134993447) internal successors, (2481), 1823 states have internal predecessors, (2481), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-10 17:38:56,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2535 transitions. [2024-11-10 17:38:56,091 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2535 transitions. Word has length 104 [2024-11-10 17:38:56,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:56,091 INFO L471 AbstractCegarLoop]: Abstraction has 1835 states and 2535 transitions. [2024-11-10 17:38:56,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 7.285714285714286) internal successors, (102), 15 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:38:56,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2535 transitions. [2024-11-10 17:38:56,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-10 17:38:56,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:56,094 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:56,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 17:38:56,094 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:56,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:56,095 INFO L85 PathProgramCache]: Analyzing trace with hash 171993580, now seen corresponding path program 1 times [2024-11-10 17:38:56,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:56,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107828414] [2024-11-10 17:38:56,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:56,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:56,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:38:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:57,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:57,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:57,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107828414] [2024-11-10 17:38:57,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107828414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:57,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:57,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 17:38:57,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014087328] [2024-11-10 17:38:57,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:57,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 17:38:57,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:57,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 17:38:57,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-10 17:38:57,015 INFO L87 Difference]: Start difference. First operand 1835 states and 2535 transitions. Second operand has 14 states, 13 states have (on average 7.846153846153846) internal successors, (102), 13 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:38:58,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:58,708 INFO L93 Difference]: Finished difference Result 1838 states and 2539 transitions. [2024-11-10 17:38:58,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 17:38:58,709 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.846153846153846) internal successors, (102), 13 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2024-11-10 17:38:58,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:58,712 INFO L225 Difference]: With dead ends: 1838 [2024-11-10 17:38:58,712 INFO L226 Difference]: Without dead ends: 1838 [2024-11-10 17:38:58,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2024-11-10 17:38:58,713 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 939 mSDsluCounter, 3108 mSDsCounter, 0 mSdLazyCounter, 3330 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 3733 SdHoareTripleChecker+Invalid, 3356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:58,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 3733 Invalid, 3356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3330 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 17:38:58,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2024-11-10 17:38:58,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1835. [2024-11-10 17:38:58,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1835 states, 1526 states have (on average 1.624508519003932) internal successors, (2479), 1823 states have internal predecessors, (2479), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-10 17:38:58,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 2533 transitions. [2024-11-10 17:38:58,735 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 2533 transitions. Word has length 104 [2024-11-10 17:38:58,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:58,736 INFO L471 AbstractCegarLoop]: Abstraction has 1835 states and 2533 transitions. [2024-11-10 17:38:58,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.846153846153846) internal successors, (102), 13 states have internal predecessors, (102), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:38:58,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 2533 transitions. [2024-11-10 17:38:58,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 17:38:58,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:58,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:58,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 17:38:58,737 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr303REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:38:58,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:58,738 INFO L85 PathProgramCache]: Analyzing trace with hash 986265344, now seen corresponding path program 1 times [2024-11-10 17:38:58,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:58,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888668064] [2024-11-10 17:38:58,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:58,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:59,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:38:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:38:59,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:59,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888668064] [2024-11-10 17:38:59,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888668064] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:38:59,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104454836] [2024-11-10 17:38:59,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:59,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:38:59,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:38:59,449 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:38:59,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 17:38:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:59,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-10 17:38:59,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:38:59,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:38:59,824 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 17:38:59,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-10 17:38:59,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:38:59,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-10 17:39:00,010 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:00,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:39:00,079 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:00,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:39:00,123 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:00,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:39:00,167 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:00,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-10 17:39:00,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 17:39:00,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:39:00,208 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:39:00,322 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2025 (Array Int Int)) (v_ArrVal_2024 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2024))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2025)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-10 17:39:04,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104454836] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:04,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:39:04,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-11-10 17:39:04,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115874808] [2024-11-10 17:39:04,602 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:39:04,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 17:39:04,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:04,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 17:39:04,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=772, Unknown=93, NotChecked=60, Total=1056 [2024-11-10 17:39:04,603 INFO L87 Difference]: Start difference. First operand 1835 states and 2533 transitions. Second operand has 26 states, 23 states have (on average 7.3478260869565215) internal successors, (169), 25 states have internal predecessors, (169), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 17:39:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:08,364 INFO L93 Difference]: Finished difference Result 1837 states and 2537 transitions. [2024-11-10 17:39:08,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 17:39:08,365 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.3478260869565215) internal successors, (169), 25 states have internal predecessors, (169), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 105 [2024-11-10 17:39:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:08,367 INFO L225 Difference]: With dead ends: 1837 [2024-11-10 17:39:08,367 INFO L226 Difference]: Without dead ends: 1837 [2024-11-10 17:39:08,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=160, Invalid=1008, Unknown=96, NotChecked=68, Total=1332 [2024-11-10 17:39:08,368 INFO L432 NwaCegarLoop]: 620 mSDtfsCounter, 886 mSDsluCounter, 9550 mSDsCounter, 0 mSdLazyCounter, 6819 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 895 SdHoareTripleChecker+Valid, 10170 SdHoareTripleChecker+Invalid, 6837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 6819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:08,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [895 Valid, 10170 Invalid, 6837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 6819 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-10 17:39:08,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1837 states. [2024-11-10 17:39:08,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1837 to 1834. [2024-11-10 17:39:08,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1834 states, 1526 states have (on average 1.6231979030144168) internal successors, (2477), 1822 states have internal predecessors, (2477), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 11 states have call predecessors, (27), 25 states have call successors, (27) [2024-11-10 17:39:08,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 2531 transitions. [2024-11-10 17:39:08,388 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 2531 transitions. Word has length 105 [2024-11-10 17:39:08,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:08,389 INFO L471 AbstractCegarLoop]: Abstraction has 1834 states and 2531 transitions. [2024-11-10 17:39:08,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.3478260869565215) internal successors, (169), 25 states have internal predecessors, (169), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-10 17:39:08,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2531 transitions. [2024-11-10 17:39:08,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-10 17:39:08,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:08,390 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:39:08,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 17:39:08,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:39:08,591 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 421 more)] === [2024-11-10 17:39:08,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:08,591 INFO L85 PathProgramCache]: Analyzing trace with hash 986265345, now seen corresponding path program 1 times [2024-11-10 17:39:08,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:08,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913481250] [2024-11-10 17:39:08,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:08,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:08,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:09,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 17:39:09,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:09,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:39:09,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:09,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913481250] [2024-11-10 17:39:09,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913481250] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:09,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417674535] [2024-11-10 17:39:09,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:09,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:39:09,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:39:09,619 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:39:09,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 17:39:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:09,926 INFO L255 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-10 17:39:09,930 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:09,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:39:10,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-10 17:39:10,062 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:39:10,063 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 17:39:10,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-10 17:39:10,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:39:10,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-10 17:39:10,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 17:39:10,316 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:10,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 17:39:10,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:39:10,404 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:10,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 17:39:10,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:39:10,476 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:10,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 17:39:10,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:39:10,556 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:10,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-10 17:39:10,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-10 17:39:10,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 17:39:10,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 17:39:10,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:39:10,625 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:39:10,707 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2214 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2213 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-10 17:39:10,719 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2213 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2214 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2024-11-10 17:39:10,738 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2212))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2211) .cse0 v_ArrVal_2214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2211) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2212) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-10 17:39:10,754 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int))) (<= 0 (+ 20 (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2211) (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2212) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2212))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2211) .cse2 v_ArrVal_2214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-10 17:39:10,780 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2209 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2210 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2210))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2212))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2209) .cse0 v_ArrVal_2211) .cse1 v_ArrVal_2214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2209 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2210 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2210))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2209) .cse5 v_ArrVal_2211) (select (select (store .cse6 .cse5 v_ArrVal_2212) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2214))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2024-11-10 17:39:11,259 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2209 (Array Int Int)) (v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2213 (Array Int Int)) (v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2220))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_2210))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2212))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2219) .cse0 v_ArrVal_2209) .cse1 v_ArrVal_2211) .cse2 v_ArrVal_2214) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2213) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_2209 (Array Int Int)) (v_ArrVal_2219 (Array Int Int)) (v_ArrVal_2214 (Array Int Int)) (v_ArrVal_2212 (Array Int Int)) (v_ArrVal_2211 (Array Int Int)) (v_ArrVal_2210 (Array Int Int)) (v_ArrVal_2220 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2220))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 v_ArrVal_2210))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2219) .cse7 v_ArrVal_2209) .cse8 v_ArrVal_2211) (select (select (store .cse9 .cse8 v_ArrVal_2212) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2214))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))) is different from false [2024-11-10 17:39:11,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417674535] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:11,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:39:11,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2024-11-10 17:39:11,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343408757] [2024-11-10 17:39:11,263 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:39:11,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 17:39:11,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:11,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 17:39:11,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=658, Unknown=8, NotChecked=342, Total=1122 [2024-11-10 17:39:11,265 INFO L87 Difference]: Start difference. First operand 1834 states and 2531 transitions. Second operand has 25 states, 22 states have (on average 7.681818181818182) internal successors, (169), 24 states have internal predecessors, (169), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2)