./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-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_test4-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 8d4416b38cd75f122474354d64a020f92e3751959548582c6308a6e879679f77 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:38:42,742 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:38:42,813 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:38:42,818 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:38:42,820 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:38:42,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:38:42,847 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:38:42,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:38:42,848 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:38:42,849 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:38:42,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:38:42,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:38:42,850 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:38:42,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:38:42,851 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:38:42,851 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:38:42,852 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:38:42,852 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:38:42,852 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:38:42,853 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:38:42,853 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:38:42,854 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:38:42,854 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:38:42,854 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:38:42,855 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:38:42,855 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:38:42,855 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:38:42,855 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:38:42,856 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:38:42,856 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:38:42,856 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:38:42,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:38:42,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:38:42,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:38:42,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:38:42,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:38:42,859 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:38:42,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:38:42,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:38:42,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:38:42,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:38:42,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:38:42,860 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 -> 8d4416b38cd75f122474354d64a020f92e3751959548582c6308a6e879679f77 [2024-11-10 17:38:43,141 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:38:43,169 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:38:43,173 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:38:43,174 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:38:43,175 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:38:43,176 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_test4-1.i [2024-11-10 17:38:44,618 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:38:44,914 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:38:44,915 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test4-1.i [2024-11-10 17:38:44,934 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2a4a98c4/edbe4238e58046a88b555021feee82cc/FLAG5115be4bd [2024-11-10 17:38:45,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2a4a98c4/edbe4238e58046a88b555021feee82cc [2024-11-10 17:38:45,203 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:38:45,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:38:45,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:38:45,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:38:45,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:38:45,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:38:45" (1/1) ... [2024-11-10 17:38:45,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5139ff3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:45, skipping insertion in model container [2024-11-10 17:38:45,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:38:45" (1/1) ... [2024-11-10 17:38:45,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:38:45,706 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:45,751 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:45,758 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:45,765 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:45,774 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:45,822 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:45,824 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:45,826 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:45,835 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:45,847 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:38:45,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:38:45,880 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:38:45,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:38:46,032 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:38:46,033 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:46 WrapperNode [2024-11-10 17:38:46,033 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:38:46,035 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:38:46,035 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:38:46,035 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:38:46,042 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:46" (1/1) ... [2024-11-10 17:38:46,082 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:46" (1/1) ... [2024-11-10 17:38:46,159 INFO L138 Inliner]: procedures = 176, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1569 [2024-11-10 17:38:46,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:38:46,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:38:46,161 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:38:46,161 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:38:46,172 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:46" (1/1) ... [2024-11-10 17:38:46,172 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:46" (1/1) ... [2024-11-10 17:38:46,190 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:46" (1/1) ... [2024-11-10 17:38:46,344 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-11-10 17:38:46,345 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:46" (1/1) ... [2024-11-10 17:38:46,345 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:46" (1/1) ... [2024-11-10 17:38:46,402 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:46" (1/1) ... [2024-11-10 17:38:46,405 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:46" (1/1) ... [2024-11-10 17:38:46,413 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:46" (1/1) ... [2024-11-10 17:38:46,419 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:46" (1/1) ... [2024-11-10 17:38:46,429 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:38:46,430 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:38:46,432 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:38:46,432 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:38:46,433 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:46" (1/1) ... [2024-11-10 17:38:46,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:38:46,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:38:46,469 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:46,476 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:46,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 17:38:46,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 17:38:46,528 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-10 17:38:46,528 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-10 17:38:46,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 17:38:46,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 17:38:46,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 17:38:46,528 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 17:38:46,528 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 17:38:46,528 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 17:38:46,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 17:38:46,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:38:46,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 17:38:46,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 17:38:46,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 17:38:46,529 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 17:38:46,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 17:38:46,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 17:38:46,529 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 17:38:46,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:38:46,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:38:46,759 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:38:46,761 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:38:49,097 INFO L? ?]: Removed 1502 outVars from TransFormulas that were not future-live. [2024-11-10 17:38:49,097 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:38:49,184 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:38:49,184 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-10 17:38:49,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:38:49 BoogieIcfgContainer [2024-11-10 17:38:49,185 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:38:49,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:38:49,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:38:49,191 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:38:49,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:38:45" (1/3) ... [2024-11-10 17:38:49,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40208f9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:38:49, skipping insertion in model container [2024-11-10 17:38:49,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:38:46" (2/3) ... [2024-11-10 17:38:49,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40208f9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:38:49, skipping insertion in model container [2024-11-10 17:38:49,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:38:49" (3/3) ... [2024-11-10 17:38:49,195 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test4-1.i [2024-11-10 17:38:49,210 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:38:49,211 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 628 error locations. [2024-11-10 17:38:49,309 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:38:49,317 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;@49b3c444, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:38:49,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-11-10 17:38:49,329 INFO L276 IsEmpty]: Start isEmpty. Operand has 1476 states, 835 states have (on average 2.044311377245509) internal successors, (1707), 1467 states have internal predecessors, (1707), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:38:49,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 17:38:49,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:49,336 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:38:49,336 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr625REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:38:49,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:49,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1934535043, now seen corresponding path program 1 times [2024-11-10 17:38:49,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:49,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717825025] [2024-11-10 17:38:49,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:49,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:49,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:49,500 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:49,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:49,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717825025] [2024-11-10 17:38:49,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717825025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:49,503 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:49,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:38:49,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886166138] [2024-11-10 17:38:49,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:49,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 17:38:49,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:49,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 17:38:49,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 17:38:49,545 INFO L87 Difference]: Start difference. First operand has 1476 states, 835 states have (on average 2.044311377245509) internal successors, (1707), 1467 states have internal predecessors, (1707), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:49,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:49,700 INFO L93 Difference]: Finished difference Result 1455 states and 1649 transitions. [2024-11-10 17:38:49,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 17:38:49,702 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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 6 [2024-11-10 17:38:49,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:49,724 INFO L225 Difference]: With dead ends: 1455 [2024-11-10 17:38:49,725 INFO L226 Difference]: Without dead ends: 1452 [2024-11-10 17:38:49,727 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 17:38:49,729 INFO L432 NwaCegarLoop]: 1605 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:49,730 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1605 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:38:49,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2024-11-10 17:38:49,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1452. [2024-11-10 17:38:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1452 states, 822 states have (on average 1.9635036496350364) internal successors, (1614), 1443 states have internal predecessors, (1614), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:38:49,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1452 states to 1452 states and 1646 transitions. [2024-11-10 17:38:49,832 INFO L78 Accepts]: Start accepts. Automaton has 1452 states and 1646 transitions. Word has length 6 [2024-11-10 17:38:49,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:49,833 INFO L471 AbstractCegarLoop]: Abstraction has 1452 states and 1646 transitions. [2024-11-10 17:38:49,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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:49,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1452 states and 1646 transitions. [2024-11-10 17:38:49,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 17:38:49,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:49,834 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:38:49,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 17:38:49,836 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr625REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:38:49,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:49,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1934535012, now seen corresponding path program 1 times [2024-11-10 17:38:49,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:49,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483480796] [2024-11-10 17:38:49,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:49,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:49,945 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:49,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:49,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483480796] [2024-11-10 17:38:49,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483480796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:49,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:49,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:38:49,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390817541] [2024-11-10 17:38:49,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:49,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:38:49,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:49,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:38:49,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:38:49,950 INFO L87 Difference]: Start difference. First operand 1452 states and 1646 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:50,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:50,935 INFO L93 Difference]: Finished difference Result 1361 states and 1556 transitions. [2024-11-10 17:38:50,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:38:50,935 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-10 17:38:50,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:50,943 INFO L225 Difference]: With dead ends: 1361 [2024-11-10 17:38:50,943 INFO L226 Difference]: Without dead ends: 1361 [2024-11-10 17:38:50,943 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:50,944 INFO L432 NwaCegarLoop]: 896 mSDtfsCounter, 1385 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1401 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:50,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1401 Valid, 911 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 17:38:50,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2024-11-10 17:38:50,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1358. [2024-11-10 17:38:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 822 states have (on average 1.8491484184914841) internal successors, (1520), 1349 states have internal predecessors, (1520), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:38:51,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1552 transitions. [2024-11-10 17:38:51,003 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1552 transitions. Word has length 6 [2024-11-10 17:38:51,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:51,004 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 1552 transitions. [2024-11-10 17:38:51,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:51,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1552 transitions. [2024-11-10 17:38:51,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 17:38:51,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:51,005 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 17:38:51,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 17:38:51,005 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr626REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:38:51,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:51,006 INFO L85 PathProgramCache]: Analyzing trace with hash -1934535011, now seen corresponding path program 1 times [2024-11-10 17:38:51,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:51,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258859935] [2024-11-10 17:38:51,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:51,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:51,111 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:51,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:51,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258859935] [2024-11-10 17:38:51,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258859935] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:51,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:51,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:38:51,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259622605] [2024-11-10 17:38:51,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:51,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:38:51,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:51,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:38:51,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:38:51,114 INFO L87 Difference]: Start difference. First operand 1358 states and 1552 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:52,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:52,131 INFO L93 Difference]: Finished difference Result 1782 states and 2054 transitions. [2024-11-10 17:38:52,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:38:52,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2024-11-10 17:38:52,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:52,138 INFO L225 Difference]: With dead ends: 1782 [2024-11-10 17:38:52,139 INFO L226 Difference]: Without dead ends: 1782 [2024-11-10 17:38:52,139 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:52,140 INFO L432 NwaCegarLoop]: 1264 mSDtfsCounter, 831 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 1917 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:52,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 1917 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 17:38:52,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2024-11-10 17:38:52,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1628. [2024-11-10 17:38:52,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1628 states, 1102 states have (on average 1.8157894736842106) internal successors, (2001), 1619 states have internal predecessors, (2001), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:38:52,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1628 states to 1628 states and 2033 transitions. [2024-11-10 17:38:52,175 INFO L78 Accepts]: Start accepts. Automaton has 1628 states and 2033 transitions. Word has length 6 [2024-11-10 17:38:52,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:52,175 INFO L471 AbstractCegarLoop]: Abstraction has 1628 states and 2033 transitions. [2024-11-10 17:38:52,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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:52,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1628 states and 2033 transitions. [2024-11-10 17:38:52,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-10 17:38:52,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:52,176 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:52,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 17:38:52,177 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:38:52,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:52,177 INFO L85 PathProgramCache]: Analyzing trace with hash 578786232, now seen corresponding path program 1 times [2024-11-10 17:38:52,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:52,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185329099] [2024-11-10 17:38:52,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:52,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:52,229 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:52,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:52,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185329099] [2024-11-10 17:38:52,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185329099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:52,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:52,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:38:52,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974019024] [2024-11-10 17:38:52,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:52,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:38:52,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:52,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:38:52,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:38:52,231 INFO L87 Difference]: Start difference. First operand 1628 states and 2033 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:52,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:52,445 INFO L93 Difference]: Finished difference Result 3204 states and 3994 transitions. [2024-11-10 17:38:52,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:38:52,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2024-11-10 17:38:52,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:52,456 INFO L225 Difference]: With dead ends: 3204 [2024-11-10 17:38:52,457 INFO L226 Difference]: Without dead ends: 3204 [2024-11-10 17:38:52,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:38:52,458 INFO L432 NwaCegarLoop]: 1776 mSDtfsCounter, 1456 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1462 SdHoareTripleChecker+Valid, 3269 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:52,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1462 Valid, 3269 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:38:52,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3204 states. [2024-11-10 17:38:52,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3204 to 1630. [2024-11-10 17:38:52,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1104 states have (on average 1.8143115942028984) internal successors, (2003), 1621 states have internal predecessors, (2003), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:38:52,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2035 transitions. [2024-11-10 17:38:52,512 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2035 transitions. Word has length 8 [2024-11-10 17:38:52,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:52,512 INFO L471 AbstractCegarLoop]: Abstraction has 1630 states and 2035 transitions. [2024-11-10 17:38:52,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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:52,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2035 transitions. [2024-11-10 17:38:52,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 17:38:52,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:52,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:52,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 17:38:52,515 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr621REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:38:52,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:52,515 INFO L85 PathProgramCache]: Analyzing trace with hash -260309777, now seen corresponding path program 1 times [2024-11-10 17:38:52,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:52,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958865785] [2024-11-10 17:38:52,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:52,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:52,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:52,602 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:52,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:52,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958865785] [2024-11-10 17:38:52,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958865785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:52,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:52,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:38:52,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925303609] [2024-11-10 17:38:52,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:52,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:38:52,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:52,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:38:52,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:38:52,605 INFO L87 Difference]: Start difference. First operand 1630 states and 2035 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) 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:53,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:53,700 INFO L93 Difference]: Finished difference Result 1656 states and 2088 transitions. [2024-11-10 17:38:53,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:38:53,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) 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:53,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:53,706 INFO L225 Difference]: With dead ends: 1656 [2024-11-10 17:38:53,707 INFO L226 Difference]: Without dead ends: 1656 [2024-11-10 17:38:53,707 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:53,708 INFO L432 NwaCegarLoop]: 870 mSDtfsCounter, 1653 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1669 SdHoareTripleChecker+Valid, 1596 SdHoareTripleChecker+Invalid, 1463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:53,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1669 Valid, 1596 Invalid, 1463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 17:38:53,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2024-11-10 17:38:53,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1607. [2024-11-10 17:38:53,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1607 states, 1104 states have (on average 1.7934782608695652) internal successors, (1980), 1598 states have internal predecessors, (1980), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:38:53,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 2012 transitions. [2024-11-10 17:38:53,742 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 2012 transitions. Word has length 13 [2024-11-10 17:38:53,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:53,742 INFO L471 AbstractCegarLoop]: Abstraction has 1607 states and 2012 transitions. [2024-11-10 17:38:53,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) 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:53,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 2012 transitions. [2024-11-10 17:38:53,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-10 17:38:53,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:53,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:53,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 17:38:53,744 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr622REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:38:53,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:53,745 INFO L85 PathProgramCache]: Analyzing trace with hash -260309776, now seen corresponding path program 1 times [2024-11-10 17:38:53,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:53,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652414477] [2024-11-10 17:38:53,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:53,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:53,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:53,828 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,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:53,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652414477] [2024-11-10 17:38:53,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652414477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:53,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:53,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:38:53,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649872982] [2024-11-10 17:38:53,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:53,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:38:53,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:53,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:38:53,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:38:53,831 INFO L87 Difference]: Start difference. First operand 1607 states and 2012 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:53,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:53,928 INFO L93 Difference]: Finished difference Result 1532 states and 1909 transitions. [2024-11-10 17:38:53,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:38:53,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:53,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:53,934 INFO L225 Difference]: With dead ends: 1532 [2024-11-10 17:38:53,935 INFO L226 Difference]: Without dead ends: 1532 [2024-11-10 17:38:53,935 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:53,936 INFO L432 NwaCegarLoop]: 1369 mSDtfsCounter, 61 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:53,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 2684 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:38:53,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-11-10 17:38:53,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1532. [2024-11-10 17:38:53,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1041 states have (on average 1.803073967339097) internal successors, (1877), 1523 states have internal predecessors, (1877), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:38:53,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1909 transitions. [2024-11-10 17:38:53,968 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1909 transitions. Word has length 13 [2024-11-10 17:38:53,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:53,968 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 1909 transitions. [2024-11-10 17:38:53,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:53,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1909 transitions. [2024-11-10 17:38:53,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-10 17:38:53,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:53,969 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:53,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 17:38:53,970 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr598REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:38:53,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:53,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1049689037, now seen corresponding path program 1 times [2024-11-10 17:38:53,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:53,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517202517] [2024-11-10 17:38:53,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:53,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:54,022 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:54,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:54,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517202517] [2024-11-10 17:38:54,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517202517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:54,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:54,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:38:54,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917487195] [2024-11-10 17:38:54,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:54,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:38:54,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:54,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:38:54,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:38:54,025 INFO L87 Difference]: Start difference. First operand 1532 states and 1909 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:54,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:54,152 INFO L93 Difference]: Finished difference Result 1514 states and 1884 transitions. [2024-11-10 17:38:54,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:38:54,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-10 17:38:54,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:54,157 INFO L225 Difference]: With dead ends: 1514 [2024-11-10 17:38:54,158 INFO L226 Difference]: Without dead ends: 1514 [2024-11-10 17:38:54,158 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:54,159 INFO L432 NwaCegarLoop]: 1334 mSDtfsCounter, 41 mSDsluCounter, 2639 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3973 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:54,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3973 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:38:54,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-11-10 17:38:54,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1511. [2024-11-10 17:38:54,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1027 states have (on average 1.8003894839337877) internal successors, (1849), 1502 states have internal predecessors, (1849), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:38:54,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 1881 transitions. [2024-11-10 17:38:54,181 INFO L78 Accepts]: Start accepts. Automaton has 1511 states and 1881 transitions. Word has length 15 [2024-11-10 17:38:54,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:54,181 INFO L471 AbstractCegarLoop]: Abstraction has 1511 states and 1881 transitions. [2024-11-10 17:38:54,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:54,181 INFO L276 IsEmpty]: Start isEmpty. Operand 1511 states and 1881 transitions. [2024-11-10 17:38:54,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 17:38:54,182 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:54,182 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] [2024-11-10 17:38:54,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 17:38:54,183 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr584REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:38:54,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:54,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1050088055, now seen corresponding path program 1 times [2024-11-10 17:38:54,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:54,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056909744] [2024-11-10 17:38:54,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:54,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:54,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:54,348 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:54,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:54,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056909744] [2024-11-10 17:38:54,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056909744] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:54,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:54,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:38:54,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158324136] [2024-11-10 17:38:54,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:54,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:38:54,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:54,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:38:54,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:38:54,350 INFO L87 Difference]: Start difference. First operand 1511 states and 1881 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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:55,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:55,517 INFO L93 Difference]: Finished difference Result 1710 states and 1974 transitions. [2024-11-10 17:38:55,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:38:55,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 29 [2024-11-10 17:38:55,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:55,523 INFO L225 Difference]: With dead ends: 1710 [2024-11-10 17:38:55,524 INFO L226 Difference]: Without dead ends: 1710 [2024-11-10 17:38:55,524 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:55,525 INFO L432 NwaCegarLoop]: 1155 mSDtfsCounter, 836 mSDsluCounter, 1406 mSDsCounter, 0 mSdLazyCounter, 1392 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 836 SdHoareTripleChecker+Valid, 2561 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:55,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [836 Valid, 2561 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1392 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 17:38:55,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2024-11-10 17:38:55,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1507. [2024-11-10 17:38:55,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1027 states have (on average 1.7964946445959105) internal successors, (1845), 1498 states have internal predecessors, (1845), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:38:55,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1877 transitions. [2024-11-10 17:38:55,554 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1877 transitions. Word has length 29 [2024-11-10 17:38:55,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:55,555 INFO L471 AbstractCegarLoop]: Abstraction has 1507 states and 1877 transitions. [2024-11-10 17:38:55,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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:55,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1877 transitions. [2024-11-10 17:38:55,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-11-10 17:38:55,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:55,562 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:55,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 17:38:55,563 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr569REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:38:55,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:55,563 INFO L85 PathProgramCache]: Analyzing trace with hash -187384333, now seen corresponding path program 1 times [2024-11-10 17:38:55,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:55,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308336427] [2024-11-10 17:38:55,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:55,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:55,665 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:55,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:55,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308336427] [2024-11-10 17:38:55,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308336427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:55,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:55,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:38:55,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983830235] [2024-11-10 17:38:55,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:55,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:38:55,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:55,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:38:55,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:38:55,669 INFO L87 Difference]: Start difference. First operand 1507 states and 1877 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:55,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:55,776 INFO L93 Difference]: Finished difference Result 1507 states and 1873 transitions. [2024-11-10 17:38:55,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:38:55,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-11-10 17:38:55,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:55,781 INFO L225 Difference]: With dead ends: 1507 [2024-11-10 17:38:55,781 INFO L226 Difference]: Without dead ends: 1507 [2024-11-10 17:38:55,781 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:55,782 INFO L432 NwaCegarLoop]: 1329 mSDtfsCounter, 21 mSDsluCounter, 2626 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3955 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:55,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3955 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:38:55,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2024-11-10 17:38:55,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2024-11-10 17:38:55,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1027 states have (on average 1.7925998052580332) internal successors, (1841), 1498 states have internal predecessors, (1841), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:38:55,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1873 transitions. [2024-11-10 17:38:55,805 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1873 transitions. Word has length 64 [2024-11-10 17:38:55,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:55,805 INFO L471 AbstractCegarLoop]: Abstraction has 1507 states and 1873 transitions. [2024-11-10 17:38:55,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:38:55,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1873 transitions. [2024-11-10 17:38:55,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-10 17:38:55,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:55,807 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] [2024-11-10 17:38:55,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 17:38:55,808 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr569REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:38:55,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:55,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1495225259, now seen corresponding path program 1 times [2024-11-10 17:38:55,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:55,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217511351] [2024-11-10 17:38:55,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:55,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:55,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:55,931 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:55,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:55,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217511351] [2024-11-10 17:38:55,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217511351] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:55,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:55,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:38:55,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651789520] [2024-11-10 17:38:55,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:55,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:38:55,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:55,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:38:55,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:38:55,933 INFO L87 Difference]: Start difference. First operand 1507 states and 1873 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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:56,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:56,066 INFO L93 Difference]: Finished difference Result 1601 states and 1994 transitions. [2024-11-10 17:38:56,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:38:56,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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 72 [2024-11-10 17:38:56,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:56,072 INFO L225 Difference]: With dead ends: 1601 [2024-11-10 17:38:56,072 INFO L226 Difference]: Without dead ends: 1601 [2024-11-10 17:38:56,072 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:56,073 INFO L432 NwaCegarLoop]: 1344 mSDtfsCounter, 54 mSDsluCounter, 1317 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2661 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:56,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2661 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:38:56,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2024-11-10 17:38:56,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1601. [2024-11-10 17:38:56,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1121 states have (on average 1.7502230151650313) internal successors, (1962), 1592 states have internal predecessors, (1962), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:38:56,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 1994 transitions. [2024-11-10 17:38:56,097 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 1994 transitions. Word has length 72 [2024-11-10 17:38:56,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:56,098 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 1994 transitions. [2024-11-10 17:38:56,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 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:56,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 1994 transitions. [2024-11-10 17:38:56,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-10 17:38:56,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:56,099 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:38:56,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 17:38:56,099 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr540REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:38:56,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:56,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1148908643, now seen corresponding path program 1 times [2024-11-10 17:38:56,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:56,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318601286] [2024-11-10 17:38:56,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:56,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:56,559 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:56,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:56,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318601286] [2024-11-10 17:38:56,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318601286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:56,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:56,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 17:38:56,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518447066] [2024-11-10 17:38:56,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:56,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:38:56,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:56,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:38:56,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:38:56,561 INFO L87 Difference]: Start difference. First operand 1601 states and 1994 transitions. Second operand has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 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:57,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:57,918 INFO L93 Difference]: Finished difference Result 1517 states and 1910 transitions. [2024-11-10 17:38:57,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:38:57,919 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 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 75 [2024-11-10 17:38:57,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:57,924 INFO L225 Difference]: With dead ends: 1517 [2024-11-10 17:38:57,924 INFO L226 Difference]: Without dead ends: 1517 [2024-11-10 17:38:57,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:38:57,925 INFO L432 NwaCegarLoop]: 596 mSDtfsCounter, 1175 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 2155 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1181 SdHoareTripleChecker+Valid, 1677 SdHoareTripleChecker+Invalid, 2248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:57,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1181 Valid, 1677 Invalid, 2248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2155 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-10 17:38:57,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-11-10 17:38:57,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1237. [2024-11-10 17:38:57,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 841 states have (on average 1.6492271105826397) internal successors, (1387), 1228 states have internal predecessors, (1387), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:38:57,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1419 transitions. [2024-11-10 17:38:57,943 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1419 transitions. Word has length 75 [2024-11-10 17:38:57,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:57,943 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1419 transitions. [2024-11-10 17:38:57,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.0) internal successors, (75), 6 states have internal predecessors, (75), 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:57,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1419 transitions. [2024-11-10 17:38:57,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 17:38:57,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:57,945 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] [2024-11-10 17:38:57,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 17:38:57,945 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr533REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:38:57,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:57,945 INFO L85 PathProgramCache]: Analyzing trace with hash -880707018, now seen corresponding path program 1 times [2024-11-10 17:38:57,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:57,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494186841] [2024-11-10 17:38:57,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:57,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:58,214 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:58,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:58,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494186841] [2024-11-10 17:38:58,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494186841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:58,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:58,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:38:58,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456470416] [2024-11-10 17:38:58,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:58,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:38:58,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:58,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:38:58,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:38:58,217 INFO L87 Difference]: Start difference. First operand 1237 states and 1419 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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:59,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:38:59,236 INFO L93 Difference]: Finished difference Result 1236 states and 1418 transitions. [2024-11-10 17:38:59,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:38:59,237 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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 80 [2024-11-10 17:38:59,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:38:59,241 INFO L225 Difference]: With dead ends: 1236 [2024-11-10 17:38:59,242 INFO L226 Difference]: Without dead ends: 1236 [2024-11-10 17:38:59,243 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:59,243 INFO L432 NwaCegarLoop]: 1256 mSDtfsCounter, 2 mSDsluCounter, 2302 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3558 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:38:59,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3558 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 17:38:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2024-11-10 17:38:59,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1236. [2024-11-10 17:38:59,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 841 states have (on average 1.648038049940547) internal successors, (1386), 1227 states have internal predecessors, (1386), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:38:59,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1418 transitions. [2024-11-10 17:38:59,261 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1418 transitions. Word has length 80 [2024-11-10 17:38:59,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:38:59,262 INFO L471 AbstractCegarLoop]: Abstraction has 1236 states and 1418 transitions. [2024-11-10 17:38:59,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1418 transitions. [2024-11-10 17:38:59,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-10 17:38:59,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:38:59,263 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] [2024-11-10 17:38:59,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 17:38:59,263 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr534REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:38:59,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:38:59,264 INFO L85 PathProgramCache]: Analyzing trace with hash -880707017, now seen corresponding path program 1 times [2024-11-10 17:38:59,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:38:59,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025885226] [2024-11-10 17:38:59,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:38:59,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:38:59,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:38:59,701 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:59,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:38:59,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025885226] [2024-11-10 17:38:59,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025885226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:38:59,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:38:59,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:38:59,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667356684] [2024-11-10 17:38:59,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:38:59,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:38:59,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:38:59,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:38:59,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:38:59,703 INFO L87 Difference]: Start difference. First operand 1236 states and 1418 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:39:00,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:00,791 INFO L93 Difference]: Finished difference Result 1235 states and 1417 transitions. [2024-11-10 17:39:00,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:39:00,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 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 80 [2024-11-10 17:39:00,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:00,795 INFO L225 Difference]: With dead ends: 1235 [2024-11-10 17:39:00,795 INFO L226 Difference]: Without dead ends: 1235 [2024-11-10 17:39:00,795 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:39:00,796 INFO L432 NwaCegarLoop]: 1256 mSDtfsCounter, 1 mSDsluCounter, 2323 mSDsCounter, 0 mSdLazyCounter, 1589 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3579 SdHoareTripleChecker+Invalid, 1590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:00,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3579 Invalid, 1590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1589 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 17:39:00,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2024-11-10 17:39:00,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1235. [2024-11-10 17:39:00,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 840 states have (on average 1.6488095238095237) internal successors, (1385), 1226 states have internal predecessors, (1385), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:39:00,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1417 transitions. [2024-11-10 17:39:00,811 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1417 transitions. Word has length 80 [2024-11-10 17:39:00,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:00,811 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1417 transitions. [2024-11-10 17:39:00,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:39:00,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1417 transitions. [2024-11-10 17:39:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 17:39:00,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:00,813 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] [2024-11-10 17:39:00,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 17:39:00,813 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr529REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:39:00,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:00,814 INFO L85 PathProgramCache]: Analyzing trace with hash 438936947, now seen corresponding path program 1 times [2024-11-10 17:39:00,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:00,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164901008] [2024-11-10 17:39:00,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:00,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:01,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:01,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:01,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:39:01,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:01,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164901008] [2024-11-10 17:39:01,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164901008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:01,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:01,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:39:01,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368213371] [2024-11-10 17:39:01,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:01,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:39:01,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:01,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:39:01,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:39:01,062 INFO L87 Difference]: Start difference. First operand 1235 states and 1417 transitions. Second operand has 7 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 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:39:02,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:02,363 INFO L93 Difference]: Finished difference Result 1247 states and 1435 transitions. [2024-11-10 17:39:02,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 17:39:02,363 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 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 88 [2024-11-10 17:39:02,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:02,370 INFO L225 Difference]: With dead ends: 1247 [2024-11-10 17:39:02,370 INFO L226 Difference]: Without dead ends: 1247 [2024-11-10 17:39:02,370 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:39:02,371 INFO L432 NwaCegarLoop]: 1239 mSDtfsCounter, 16 mSDsluCounter, 4175 mSDsCounter, 0 mSdLazyCounter, 2323 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 5414 SdHoareTripleChecker+Invalid, 2340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:02,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 5414 Invalid, 2340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2323 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-10 17:39:02,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2024-11-10 17:39:02,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1241. [2024-11-10 17:39:02,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 845 states have (on average 1.647337278106509) internal successors, (1392), 1231 states have internal predecessors, (1392), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-10 17:39:02,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1430 transitions. [2024-11-10 17:39:02,391 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1430 transitions. Word has length 88 [2024-11-10 17:39:02,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:02,391 INFO L471 AbstractCegarLoop]: Abstraction has 1241 states and 1430 transitions. [2024-11-10 17:39:02,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.2) internal successors, (86), 6 states have internal predecessors, (86), 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:39:02,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1430 transitions. [2024-11-10 17:39:02,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-10 17:39:02,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:02,393 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] [2024-11-10 17:39:02,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 17:39:02,394 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr530REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:39:02,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:02,395 INFO L85 PathProgramCache]: Analyzing trace with hash 438936948, now seen corresponding path program 1 times [2024-11-10 17:39:02,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:02,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412771946] [2024-11-10 17:39:02,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:02,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:02,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:02,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:02,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:39:02,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:02,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412771946] [2024-11-10 17:39:02,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412771946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:02,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:02,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:39:02,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59151612] [2024-11-10 17:39:02,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:02,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:39:02,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:02,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:39:02,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:39:02,907 INFO L87 Difference]: Start difference. First operand 1241 states and 1430 transitions. Second operand has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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:39:04,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:04,111 INFO L93 Difference]: Finished difference Result 1241 states and 1429 transitions. [2024-11-10 17:39:04,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:39:04,112 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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 88 [2024-11-10 17:39:04,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:04,115 INFO L225 Difference]: With dead ends: 1241 [2024-11-10 17:39:04,115 INFO L226 Difference]: Without dead ends: 1241 [2024-11-10 17:39:04,115 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:39:04,116 INFO L432 NwaCegarLoop]: 1246 mSDtfsCounter, 17 mSDsluCounter, 3292 mSDsCounter, 0 mSdLazyCounter, 1902 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4538 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:04,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4538 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1902 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 17:39:04,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2024-11-10 17:39:04,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1241. [2024-11-10 17:39:04,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1241 states, 845 states have (on average 1.646153846153846) internal successors, (1391), 1231 states have internal predecessors, (1391), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-10 17:39:04,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1429 transitions. [2024-11-10 17:39:04,133 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1429 transitions. Word has length 88 [2024-11-10 17:39:04,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:04,134 INFO L471 AbstractCegarLoop]: Abstraction has 1241 states and 1429 transitions. [2024-11-10 17:39:04,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.333333333333334) internal successors, (86), 6 states have internal predecessors, (86), 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:39:04,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1429 transitions. [2024-11-10 17:39:04,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 17:39:04,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:04,135 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] [2024-11-10 17:39:04,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 17:39:04,135 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr529REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:39:04,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:04,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1928089351, now seen corresponding path program 1 times [2024-11-10 17:39:04,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:04,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556862146] [2024-11-10 17:39:04,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:04,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:04,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:04,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:04,634 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:04,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:04,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556862146] [2024-11-10 17:39:04,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556862146] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:04,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720616264] [2024-11-10 17:39:04,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:04,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:39:04,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:39:04,639 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:39:04,640 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:39:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:04,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 17:39:04,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:04,906 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:05,038 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:39:05,038 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:05,056 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:05,140 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:05,140 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:05,173 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:05,177 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:05,178 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:39:05,224 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-10 17:39:05,224 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:39:05,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720616264] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:05,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:39:05,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2024-11-10 17:39:05,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761443592] [2024-11-10 17:39:05,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:39:05,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 17:39:05,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:05,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 17:39:05,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=196, Unknown=6, NotChecked=0, Total=240 [2024-11-10 17:39:05,274 INFO L87 Difference]: Start difference. First operand 1241 states and 1429 transitions. Second operand has 15 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:39:08,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:08,162 INFO L93 Difference]: Finished difference Result 1240 states and 1428 transitions. [2024-11-10 17:39:08,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:39:08,163 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 89 [2024-11-10 17:39:08,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:08,166 INFO L225 Difference]: With dead ends: 1240 [2024-11-10 17:39:08,167 INFO L226 Difference]: Without dead ends: 1240 [2024-11-10 17:39:08,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=453, Unknown=6, NotChecked=0, Total=552 [2024-11-10 17:39:08,167 INFO L432 NwaCegarLoop]: 765 mSDtfsCounter, 1188 mSDsluCounter, 7999 mSDsCounter, 0 mSdLazyCounter, 6685 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 8764 SdHoareTripleChecker+Invalid, 6716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 6685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:08,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 8764 Invalid, 6716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 6685 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-10 17:39:08,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2024-11-10 17:39:08,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 1240. [2024-11-10 17:39:08,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 845 states have (on average 1.6449704142011834) internal successors, (1390), 1230 states have internal predecessors, (1390), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-10 17:39:08,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 1428 transitions. [2024-11-10 17:39:08,191 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 1428 transitions. Word has length 89 [2024-11-10 17:39:08,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:08,192 INFO L471 AbstractCegarLoop]: Abstraction has 1240 states and 1428 transitions. [2024-11-10 17:39:08,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 9.846153846153847) internal successors, (128), 13 states have internal predecessors, (128), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:39:08,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 1428 transitions. [2024-11-10 17:39:08,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 17:39:08,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:08,193 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] [2024-11-10 17:39:08,211 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:39:08,393 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:39:08,394 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr530REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:39:08,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:08,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1928089350, now seen corresponding path program 1 times [2024-11-10 17:39:08,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:08,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148093947] [2024-11-10 17:39:08,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:08,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:09,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:09,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:09,107 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,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:09,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148093947] [2024-11-10 17:39:09,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148093947] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:09,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149609173] [2024-11-10 17:39:09,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:09,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:39:09,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:39:09,110 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:39:09,111 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:39:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:09,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-10 17:39:09,337 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:09,344 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:09,473 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:39:09,474 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:09,480 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:39:09,522 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:09,529 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:09,595 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:09,599 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:09,716 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:09,716 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:09,721 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:09,753 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:09,757 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:09,760 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,760 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:39:09,865 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_644 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_645) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_644) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_645 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_645) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-10 17:39:09,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149609173] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:09,868 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:39:09,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2024-11-10 17:39:09,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493797210] [2024-11-10 17:39:09,868 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:39:09,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 17:39:09,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:09,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 17:39:09,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=255, Unknown=1, NotChecked=32, Total=342 [2024-11-10 17:39:09,869 INFO L87 Difference]: Start difference. First operand 1240 states and 1428 transitions. Second operand has 16 states, 13 states have (on average 10.23076923076923) internal successors, (133), 15 states have internal predecessors, (133), 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:13,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:13,366 INFO L93 Difference]: Finished difference Result 1247 states and 1435 transitions. [2024-11-10 17:39:13,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 17:39:13,367 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 10.23076923076923) internal successors, (133), 15 states have internal predecessors, (133), 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 89 [2024-11-10 17:39:13,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:13,371 INFO L225 Difference]: With dead ends: 1247 [2024-11-10 17:39:13,371 INFO L226 Difference]: Without dead ends: 1247 [2024-11-10 17:39:13,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=89, Invalid=420, Unknown=1, NotChecked=42, Total=552 [2024-11-10 17:39:13,371 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 1193 mSDsluCounter, 5482 mSDsCounter, 0 mSdLazyCounter, 6599 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1213 SdHoareTripleChecker+Valid, 6252 SdHoareTripleChecker+Invalid, 6645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 6599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:13,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1213 Valid, 6252 Invalid, 6645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 6599 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-10 17:39:13,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2024-11-10 17:39:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1238. [2024-11-10 17:39:13,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 844 states have (on average 1.6445497630331753) internal successors, (1388), 1228 states have internal predecessors, (1388), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:39:13,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1420 transitions. [2024-11-10 17:39:13,390 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1420 transitions. Word has length 89 [2024-11-10 17:39:13,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:13,390 INFO L471 AbstractCegarLoop]: Abstraction has 1238 states and 1420 transitions. [2024-11-10 17:39:13,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 10.23076923076923) internal successors, (133), 15 states have internal predecessors, (133), 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:13,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1420 transitions. [2024-11-10 17:39:13,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 17:39:13,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:13,392 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] [2024-11-10 17:39:13,410 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:39:13,592 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:39:13,593 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr525REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:39:13,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:13,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1803483820, now seen corresponding path program 1 times [2024-11-10 17:39:13,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:13,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307949245] [2024-11-10 17:39:13,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:13,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:13,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:14,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:14,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:14,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:39:14,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:14,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307949245] [2024-11-10 17:39:14,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307949245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:14,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:14,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 17:39:14,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823989799] [2024-11-10 17:39:14,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:14,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 17:39:14,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:14,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 17:39:14,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-10 17:39:14,111 INFO L87 Difference]: Start difference. First operand 1238 states and 1420 transitions. Second operand has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 states have internal predecessors, (89), 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:39:16,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:16,238 INFO L93 Difference]: Finished difference Result 1251 states and 1439 transitions. [2024-11-10 17:39:16,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 17:39:16,239 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 states have internal predecessors, (89), 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 91 [2024-11-10 17:39:16,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:16,243 INFO L225 Difference]: With dead ends: 1251 [2024-11-10 17:39:16,243 INFO L226 Difference]: Without dead ends: 1251 [2024-11-10 17:39:16,243 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:39:16,244 INFO L432 NwaCegarLoop]: 764 mSDtfsCounter, 1201 mSDsluCounter, 5831 mSDsCounter, 0 mSdLazyCounter, 5045 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 6595 SdHoareTripleChecker+Invalid, 5076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 5045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:16,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 6595 Invalid, 5076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 5045 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-10 17:39:16,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2024-11-10 17:39:16,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1247. [2024-11-10 17:39:16,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 852 states have (on average 1.6408450704225352) internal successors, (1398), 1236 states have internal predecessors, (1398), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-10 17:39:16,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1431 transitions. [2024-11-10 17:39:16,262 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1431 transitions. Word has length 91 [2024-11-10 17:39:16,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:16,262 INFO L471 AbstractCegarLoop]: Abstraction has 1247 states and 1431 transitions. [2024-11-10 17:39:16,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 13 states have internal predecessors, (89), 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:39:16,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1431 transitions. [2024-11-10 17:39:16,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-10 17:39:16,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:16,264 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] [2024-11-10 17:39:16,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 17:39:16,264 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr526REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:39:16,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:16,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1803483819, now seen corresponding path program 1 times [2024-11-10 17:39:16,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:16,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666442279] [2024-11-10 17:39:16,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:16,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:16,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:17,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:39:17,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:17,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666442279] [2024-11-10 17:39:17,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666442279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:17,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:17,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 17:39:17,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082075715] [2024-11-10 17:39:17,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:17,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 17:39:17,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:17,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 17:39:17,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-10 17:39:17,015 INFO L87 Difference]: Start difference. First operand 1247 states and 1431 transitions. Second operand has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 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:39:19,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:19,669 INFO L93 Difference]: Finished difference Result 1250 states and 1438 transitions. [2024-11-10 17:39:19,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 17:39:19,669 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 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 91 [2024-11-10 17:39:19,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:19,673 INFO L225 Difference]: With dead ends: 1250 [2024-11-10 17:39:19,673 INFO L226 Difference]: Without dead ends: 1250 [2024-11-10 17:39:19,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-10 17:39:19,674 INFO L432 NwaCegarLoop]: 771 mSDtfsCounter, 1199 mSDsluCounter, 4944 mSDsCounter, 0 mSdLazyCounter, 5881 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 5715 SdHoareTripleChecker+Invalid, 5925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 5881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:19,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 5715 Invalid, 5925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 5881 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-10 17:39:19,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2024-11-10 17:39:19,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1247. [2024-11-10 17:39:19,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 852 states have (on average 1.6396713615023475) internal successors, (1397), 1236 states have internal predecessors, (1397), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-10 17:39:19,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1430 transitions. [2024-11-10 17:39:19,689 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1430 transitions. Word has length 91 [2024-11-10 17:39:19,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:19,690 INFO L471 AbstractCegarLoop]: Abstraction has 1247 states and 1430 transitions. [2024-11-10 17:39:19,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 11 states have internal predecessors, (89), 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:39:19,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1430 transitions. [2024-11-10 17:39:19,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 17:39:19,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:19,691 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] [2024-11-10 17:39:19,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 17:39:19,691 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr525REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:39:19,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:19,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1184105486, now seen corresponding path program 1 times [2024-11-10 17:39:19,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:19,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807782104] [2024-11-10 17:39:19,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:19,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:20,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:20,191 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:20,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:20,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807782104] [2024-11-10 17:39:20,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807782104] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:20,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778573614] [2024-11-10 17:39:20,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:20,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:39:20,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:39:20,194 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:39:20,197 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:39:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:20,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-10 17:39:20,436 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:20,440 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:20,544 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:39:20,545 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:20,558 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:20,639 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:20,640 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:20,692 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:20,692 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:20,708 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:20,711 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:20,711 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:39:20,807 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-10 17:39:20,807 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 33 treesize of output 32 [2024-11-10 17:39:20,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778573614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:20,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:39:20,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 17 [2024-11-10 17:39:20,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634162315] [2024-11-10 17:39:20,849 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:39:20,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 17:39:20,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:20,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 17:39:20,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=340, Unknown=20, NotChecked=0, Total=420 [2024-11-10 17:39:20,851 INFO L87 Difference]: Start difference. First operand 1247 states and 1430 transitions. Second operand has 18 states, 16 states have (on average 8.625) internal successors, (138), 17 states have internal predecessors, (138), 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:39:23,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:23,756 INFO L93 Difference]: Finished difference Result 1249 states and 1437 transitions. [2024-11-10 17:39:23,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:39:23,756 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.625) internal successors, (138), 17 states have internal predecessors, (138), 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 92 [2024-11-10 17:39:23,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:23,760 INFO L225 Difference]: With dead ends: 1249 [2024-11-10 17:39:23,760 INFO L226 Difference]: Without dead ends: 1249 [2024-11-10 17:39:23,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=667, Unknown=21, NotChecked=0, Total=812 [2024-11-10 17:39:23,761 INFO L432 NwaCegarLoop]: 764 mSDtfsCounter, 1186 mSDsluCounter, 8770 mSDsCounter, 0 mSdLazyCounter, 7185 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1206 SdHoareTripleChecker+Valid, 9534 SdHoareTripleChecker+Invalid, 7215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 7185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:23,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1206 Valid, 9534 Invalid, 7215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 7185 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-10 17:39:23,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2024-11-10 17:39:23,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1246. [2024-11-10 17:39:23,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 852 states have (on average 1.6384976525821595) internal successors, (1396), 1235 states have internal predecessors, (1396), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-10 17:39:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 1429 transitions. [2024-11-10 17:39:23,775 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 1429 transitions. Word has length 92 [2024-11-10 17:39:23,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:23,775 INFO L471 AbstractCegarLoop]: Abstraction has 1246 states and 1429 transitions. [2024-11-10 17:39:23,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.625) internal successors, (138), 17 states have internal predecessors, (138), 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:39:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 1429 transitions. [2024-11-10 17:39:23,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 17:39:23,776 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:23,777 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] [2024-11-10 17:39:23,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 17:39:23,977 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:39:23,978 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr526REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:39:23,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:23,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1184105487, now seen corresponding path program 1 times [2024-11-10 17:39:23,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:23,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718181594] [2024-11-10 17:39:23,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:23,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:24,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:24,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:24,802 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:24,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:24,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718181594] [2024-11-10 17:39:24,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718181594] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:24,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276630855] [2024-11-10 17:39:24,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:24,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:39:24,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:39:24,806 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:39:24,808 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:39:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:25,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-10 17:39:25,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:25,056 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:25,151 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:25,158 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:39:25,158 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:25,167 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:25,170 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:25,218 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:25,222 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:25,320 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:25,323 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:25,328 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:25,398 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:25,398 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:25,404 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:25,420 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:25,425 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:25,429 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:25,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:39:25,536 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1046 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1046) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1046 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1046) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1047) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-10 17:39:25,588 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1052 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1052) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1053) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1046) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1047 (Array Int Int)) (v_ArrVal_1046 (Array Int Int)) (v_ArrVal_1053 (Array Int Int)) (v_ArrVal_1052 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1053))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1052) .cse1 v_ArrVal_1046) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1047) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-10 17:39:25,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276630855] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:25,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:39:25,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 16 [2024-11-10 17:39:25,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662644646] [2024-11-10 17:39:25,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:39:25,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 17:39:25,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:25,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 17:39:25,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=319, Unknown=9, NotChecked=74, Total=462 [2024-11-10 17:39:25,593 INFO L87 Difference]: Start difference. First operand 1246 states and 1429 transitions. Second operand has 17 states, 15 states have (on average 9.133333333333333) internal successors, (137), 16 states have internal predecessors, (137), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:39:29,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:29,809 INFO L93 Difference]: Finished difference Result 1248 states and 1436 transitions. [2024-11-10 17:39:29,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:39:29,809 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 9.133333333333333) internal successors, (137), 16 states have internal predecessors, (137), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 92 [2024-11-10 17:39:29,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:29,812 INFO L225 Difference]: With dead ends: 1248 [2024-11-10 17:39:29,812 INFO L226 Difference]: Without dead ends: 1248 [2024-11-10 17:39:29,812 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=640, Unknown=9, NotChecked=106, Total=870 [2024-11-10 17:39:29,813 INFO L432 NwaCegarLoop]: 762 mSDtfsCounter, 1188 mSDsluCounter, 6415 mSDsCounter, 0 mSdLazyCounter, 8304 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1208 SdHoareTripleChecker+Valid, 7177 SdHoareTripleChecker+Invalid, 8337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 8304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:29,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1208 Valid, 7177 Invalid, 8337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 8304 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-10 17:39:29,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2024-11-10 17:39:29,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1236. [2024-11-10 17:39:29,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1236 states, 844 states have (on average 1.6421800947867298) internal successors, (1386), 1226 states have internal predecessors, (1386), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:39:29,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1236 states to 1236 states and 1418 transitions. [2024-11-10 17:39:29,827 INFO L78 Accepts]: Start accepts. Automaton has 1236 states and 1418 transitions. Word has length 92 [2024-11-10 17:39:29,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:29,827 INFO L471 AbstractCegarLoop]: Abstraction has 1236 states and 1418 transitions. [2024-11-10 17:39:29,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 9.133333333333333) internal successors, (137), 16 states have internal predecessors, (137), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-10 17:39:29,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1236 states and 1418 transitions. [2024-11-10 17:39:29,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 17:39:29,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:29,829 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:39:29,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 17:39:30,032 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:39:30,033 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr521REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:39:30,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:30,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1839238484, now seen corresponding path program 1 times [2024-11-10 17:39:30,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:30,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590398922] [2024-11-10 17:39:30,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:30,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:30,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:30,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:30,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:39:30,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:30,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590398922] [2024-11-10 17:39:30,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590398922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:30,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:30,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 17:39:30,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301528790] [2024-11-10 17:39:30,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:30,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 17:39:30,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:30,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 17:39:30,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-10 17:39:30,604 INFO L87 Difference]: Start difference. First operand 1236 states and 1418 transitions. Second operand has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 14 states have internal predecessors, (92), 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:39:32,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:32,987 INFO L93 Difference]: Finished difference Result 1252 states and 1440 transitions. [2024-11-10 17:39:32,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:39:32,987 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 14 states have internal predecessors, (92), 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 94 [2024-11-10 17:39:32,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:32,990 INFO L225 Difference]: With dead ends: 1252 [2024-11-10 17:39:32,990 INFO L226 Difference]: Without dead ends: 1252 [2024-11-10 17:39:32,991 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:39:32,992 INFO L432 NwaCegarLoop]: 763 mSDtfsCounter, 1202 mSDsluCounter, 5826 mSDsCounter, 0 mSdLazyCounter, 5045 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 6589 SdHoareTripleChecker+Invalid, 5076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 5045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:32,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 6589 Invalid, 5076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 5045 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-10 17:39:32,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2024-11-10 17:39:33,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1248. [2024-11-10 17:39:33,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 855 states have (on average 1.6362573099415205) internal successors, (1399), 1237 states have internal predecessors, (1399), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-10 17:39:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1432 transitions. [2024-11-10 17:39:33,015 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1432 transitions. Word has length 94 [2024-11-10 17:39:33,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:33,015 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 1432 transitions. [2024-11-10 17:39:33,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.076923076923077) internal successors, (92), 14 states have internal predecessors, (92), 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:39:33,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1432 transitions. [2024-11-10 17:39:33,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-10 17:39:33,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:33,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] [2024-11-10 17:39:33,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 17:39:33,017 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr522REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:39:33,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:33,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1839238483, now seen corresponding path program 1 times [2024-11-10 17:39:33,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:33,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289766592] [2024-11-10 17:39:33,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:33,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:33,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:33,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:33,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:39:33,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:33,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289766592] [2024-11-10 17:39:33,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289766592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:33,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:33,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 17:39:33,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227295562] [2024-11-10 17:39:33,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:33,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 17:39:33,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:33,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 17:39:33,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-10 17:39:33,783 INFO L87 Difference]: Start difference. First operand 1248 states and 1432 transitions. Second operand has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 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:39:36,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:36,186 INFO L93 Difference]: Finished difference Result 1251 states and 1439 transitions. [2024-11-10 17:39:36,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 17:39:36,186 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 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 94 [2024-11-10 17:39:36,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:36,189 INFO L225 Difference]: With dead ends: 1251 [2024-11-10 17:39:36,189 INFO L226 Difference]: Without dead ends: 1251 [2024-11-10 17:39:36,189 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:39:36,190 INFO L432 NwaCegarLoop]: 770 mSDtfsCounter, 1200 mSDsluCounter, 4393 mSDsCounter, 0 mSdLazyCounter, 5149 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 5163 SdHoareTripleChecker+Invalid, 5193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 5149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:36,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 5163 Invalid, 5193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 5149 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 17:39:36,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2024-11-10 17:39:36,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1248. [2024-11-10 17:39:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1248 states, 855 states have (on average 1.6350877192982456) internal successors, (1398), 1237 states have internal predecessors, (1398), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-10 17:39:36,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1248 states to 1248 states and 1431 transitions. [2024-11-10 17:39:36,205 INFO L78 Accepts]: Start accepts. Automaton has 1248 states and 1431 transitions. Word has length 94 [2024-11-10 17:39:36,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:36,205 INFO L471 AbstractCegarLoop]: Abstraction has 1248 states and 1431 transitions. [2024-11-10 17:39:36,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.666666666666667) internal successors, (92), 12 states have internal predecessors, (92), 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:39:36,205 INFO L276 IsEmpty]: Start isEmpty. Operand 1248 states and 1431 transitions. [2024-11-10 17:39:36,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 17:39:36,208 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:36,208 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:39:36,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 17:39:36,209 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr521REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:39:36,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:36,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1121468850, now seen corresponding path program 1 times [2024-11-10 17:39:36,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:36,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934504359] [2024-11-10 17:39:36,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:36,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:36,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:36,782 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:36,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:36,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934504359] [2024-11-10 17:39:36,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934504359] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:36,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051361648] [2024-11-10 17:39:36,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:36,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:39:36,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:39:36,785 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:39:36,786 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:39:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:37,031 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 17:39:37,034 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:37,038 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:37,126 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:39:37,126 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:37,132 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:37,191 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:37,191 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:37,232 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:37,232 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:37,270 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:37,271 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:37,286 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:37,289 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:37,289 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:39:37,366 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1333 (Array Int Int)) (v_ArrVal_1332 (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$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1332))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1333)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-10 17:39:37,374 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1333 (Array Int Int)) (v_ArrVal_1332 (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$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1332))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1333)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-10 17:39:37,409 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-10 17:39:37,409 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 57 treesize of output 56 [2024-11-10 17:39:37,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051361648] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:37,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:39:37,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 19 [2024-11-10 17:39:37,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294788811] [2024-11-10 17:39:37,444 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:39:37,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 17:39:37,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:37,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 17:39:37,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=409, Unknown=30, NotChecked=86, Total=600 [2024-11-10 17:39:37,445 INFO L87 Difference]: Start difference. First operand 1248 states and 1431 transitions. Second operand has 20 states, 18 states have (on average 7.944444444444445) internal successors, (143), 19 states have internal predecessors, (143), 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:39:40,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:40,390 INFO L93 Difference]: Finished difference Result 1250 states and 1438 transitions. [2024-11-10 17:39:40,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 17:39:40,390 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 7.944444444444445) internal successors, (143), 19 states have internal predecessors, (143), 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 95 [2024-11-10 17:39:40,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:40,393 INFO L225 Difference]: With dead ends: 1250 [2024-11-10 17:39:40,393 INFO L226 Difference]: Without dead ends: 1250 [2024-11-10 17:39:40,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=819, Unknown=31, NotChecked=122, Total=1122 [2024-11-10 17:39:40,393 INFO L432 NwaCegarLoop]: 763 mSDtfsCounter, 1180 mSDsluCounter, 8738 mSDsCounter, 0 mSdLazyCounter, 7204 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 9501 SdHoareTripleChecker+Invalid, 7234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 7204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:40,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 9501 Invalid, 7234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 7204 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-10 17:39:40,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2024-11-10 17:39:40,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1247. [2024-11-10 17:39:40,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1247 states, 855 states have (on average 1.6339181286549707) internal successors, (1397), 1236 states have internal predecessors, (1397), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-10 17:39:40,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1430 transitions. [2024-11-10 17:39:40,408 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1430 transitions. Word has length 95 [2024-11-10 17:39:40,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:40,409 INFO L471 AbstractCegarLoop]: Abstraction has 1247 states and 1430 transitions. [2024-11-10 17:39:40,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 7.944444444444445) internal successors, (143), 19 states have internal predecessors, (143), 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:39:40,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1430 transitions. [2024-11-10 17:39:40,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 17:39:40,411 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:40,411 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:39:40,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 17:39:40,612 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:39:40,612 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr522REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:39:40,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:40,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1121468851, now seen corresponding path program 1 times [2024-11-10 17:39:40,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:40,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085939598] [2024-11-10 17:39:40,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:40,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:40,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:41,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:41,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:41,442 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:41,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:41,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085939598] [2024-11-10 17:39:41,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085939598] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:41,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695035085] [2024-11-10 17:39:41,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:41,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:39:41,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:39:41,445 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:39:41,447 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:39:41,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:41,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-10 17:39:41,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:41,709 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:41,809 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:39:41,809 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:41,815 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:39:41,839 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:41,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:39:41,918 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:41,923 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:42,022 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:42,022 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:42,028 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:42,098 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:42,099 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:42,104 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:42,154 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:42,155 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:42,159 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:42,173 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:42,181 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:42,201 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:42,202 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:39:42,262 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1493 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1493) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1494 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))))) is different from false [2024-11-10 17:39:42,272 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1494 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1493 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1493) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-10 17:39:42,289 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1492))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1491) .cse0 v_ArrVal_1494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1493) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1491) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))))) is different from false [2024-11-10 17:39:42,303 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$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1491) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1492))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1491) .cse2 v_ArrVal_1494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1493) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-10 17:39:42,355 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1500 (Array Int Int)) (v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (<= 0 (+ 8 (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1499))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1500) .cse0 v_ArrVal_1491) (select (select (store .cse1 .cse0 v_ArrVal_1492) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1494))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (forall ((v_ArrVal_1500 (Array Int Int)) (v_ArrVal_1499 (Array Int Int)) (v_ArrVal_1494 (Array Int Int)) (v_ArrVal_1493 (Array Int Int)) (v_ArrVal_1492 (Array Int Int)) (v_ArrVal_1491 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1499))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1492))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1500) .cse3 v_ArrVal_1491) .cse4 v_ArrVal_1494) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1493) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-10 17:39:42,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695035085] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:42,358 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:39:42,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 22 [2024-11-10 17:39:42,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217889555] [2024-11-10 17:39:42,358 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:39:42,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-10 17:39:42,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:42,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-10 17:39:42,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=523, Unknown=5, NotChecked=250, Total=870 [2024-11-10 17:39:42,360 INFO L87 Difference]: Start difference. First operand 1247 states and 1430 transitions. Second operand has 23 states, 20 states have (on average 7.55) internal successors, (151), 22 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:39:47,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:47,092 INFO L93 Difference]: Finished difference Result 1249 states and 1437 transitions. [2024-11-10 17:39:47,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:39:47,092 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 7.55) internal successors, (151), 22 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 95 [2024-11-10 17:39:47,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:47,094 INFO L225 Difference]: With dead ends: 1249 [2024-11-10 17:39:47,094 INFO L226 Difference]: Without dead ends: 1249 [2024-11-10 17:39:47,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=855, Unknown=5, NotChecked=320, Total=1332 [2024-11-10 17:39:47,095 INFO L432 NwaCegarLoop]: 768 mSDtfsCounter, 1194 mSDsluCounter, 8435 mSDsCounter, 0 mSdLazyCounter, 10044 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 9203 SdHoareTripleChecker+Invalid, 10093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 10044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:47,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 9203 Invalid, 10093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 10044 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-10 17:39:47,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2024-11-10 17:39:47,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1234. [2024-11-10 17:39:47,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 844 states have (on average 1.6398104265402844) internal successors, (1384), 1224 states have internal predecessors, (1384), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 17:39:47,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1416 transitions. [2024-11-10 17:39:47,111 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 1416 transitions. Word has length 95 [2024-11-10 17:39:47,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:47,111 INFO L471 AbstractCegarLoop]: Abstraction has 1234 states and 1416 transitions. [2024-11-10 17:39:47,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 7.55) internal successors, (151), 22 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:39:47,111 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1416 transitions. [2024-11-10 17:39:47,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 17:39:47,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:47,112 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] [2024-11-10 17:39:47,126 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:39:47,312 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:39:47,313 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr517REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:39:47,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:47,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1854551251, now seen corresponding path program 1 times [2024-11-10 17:39:47,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:47,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138955740] [2024-11-10 17:39:47,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:47,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:47,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:47,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:47,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:39:47,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:47,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138955740] [2024-11-10 17:39:47,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138955740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:47,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:47,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 17:39:47,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538318153] [2024-11-10 17:39:47,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:47,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 17:39:47,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:47,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 17:39:47,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-10 17:39:47,917 INFO L87 Difference]: Start difference. First operand 1234 states and 1416 transitions. Second operand has 16 states, 14 states have (on average 6.785714285714286) internal successors, (95), 15 states have internal predecessors, (95), 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:39:49,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:49,884 INFO L93 Difference]: Finished difference Result 1253 states and 1441 transitions. [2024-11-10 17:39:49,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 17:39:49,885 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.785714285714286) internal successors, (95), 15 states have internal predecessors, (95), 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 97 [2024-11-10 17:39:49,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:49,887 INFO L225 Difference]: With dead ends: 1253 [2024-11-10 17:39:49,887 INFO L226 Difference]: Without dead ends: 1253 [2024-11-10 17:39:49,887 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:39:49,888 INFO L432 NwaCegarLoop]: 762 mSDtfsCounter, 1203 mSDsluCounter, 5107 mSDsCounter, 0 mSdLazyCounter, 4487 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 5869 SdHoareTripleChecker+Invalid, 4518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:49,888 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 5869 Invalid, 4518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 4487 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-10 17:39:49,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2024-11-10 17:39:49,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 1249. [2024-11-10 17:39:49,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 858 states have (on average 1.6317016317016317) internal successors, (1400), 1238 states have internal predecessors, (1400), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-10 17:39:49,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1433 transitions. [2024-11-10 17:39:49,900 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1433 transitions. Word has length 97 [2024-11-10 17:39:49,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:49,901 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1433 transitions. [2024-11-10 17:39:49,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.785714285714286) internal successors, (95), 15 states have internal predecessors, (95), 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:39:49,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1433 transitions. [2024-11-10 17:39:49,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-10 17:39:49,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:49,902 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] [2024-11-10 17:39:49,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 17:39:49,903 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr518REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:39:49,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:49,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1854551250, now seen corresponding path program 1 times [2024-11-10 17:39:49,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:49,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833802100] [2024-11-10 17:39:49,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:49,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:50,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:39:50,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:50,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833802100] [2024-11-10 17:39:50,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833802100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:39:50,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:39:50,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 17:39:50,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257239807] [2024-11-10 17:39:50,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:39:50,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 17:39:50,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:39:50,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 17:39:50,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-10 17:39:50,714 INFO L87 Difference]: Start difference. First operand 1249 states and 1433 transitions. Second operand has 14 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 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:39:53,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:39:53,171 INFO L93 Difference]: Finished difference Result 1252 states and 1440 transitions. [2024-11-10 17:39:53,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 17:39:53,171 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 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 97 [2024-11-10 17:39:53,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:39:53,173 INFO L225 Difference]: With dead ends: 1252 [2024-11-10 17:39:53,173 INFO L226 Difference]: Without dead ends: 1252 [2024-11-10 17:39:53,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-10 17:39:53,174 INFO L432 NwaCegarLoop]: 769 mSDtfsCounter, 1196 mSDsluCounter, 5126 mSDsCounter, 0 mSdLazyCounter, 5678 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 5895 SdHoareTripleChecker+Invalid, 5707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 5678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:39:53,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 5895 Invalid, 5707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 5678 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 17:39:53,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2024-11-10 17:39:53,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1249. [2024-11-10 17:39:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 858 states have (on average 1.6305361305361306) internal successors, (1399), 1238 states have internal predecessors, (1399), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-10 17:39:53,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1432 transitions. [2024-11-10 17:39:53,184 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1432 transitions. Word has length 97 [2024-11-10 17:39:53,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:39:53,184 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1432 transitions. [2024-11-10 17:39:53,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.3076923076923075) internal successors, (95), 13 states have internal predecessors, (95), 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:39:53,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1432 transitions. [2024-11-10 17:39:53,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 17:39:53,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:39:53,186 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:39:53,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 17:39:53,186 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr517REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:39:53,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:39:53,186 INFO L85 PathProgramCache]: Analyzing trace with hash -870754713, now seen corresponding path program 1 times [2024-11-10 17:39:53,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:39:53,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136262953] [2024-11-10 17:39:53,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:53,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:39:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:53,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 17:39:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:53,757 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:53,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:39:53,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136262953] [2024-11-10 17:39:53,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136262953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:39:53,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213237203] [2024-11-10 17:39:53,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:39:53,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:39:53,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:39:53,760 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:39:53,761 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:39:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:39:54,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 17:39:54,023 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:39:54,026 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:54,117 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:39:54,117 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:54,124 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:54,193 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:54,194 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:54,228 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:54,228 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:54,261 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:54,261 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:54,295 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:39:54,295 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:54,304 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:54,307 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:54,307 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:39:54,318 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1805 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1805) |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:39:54,350 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1805 (Array Int Int)) (v_ArrVal_1804 (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$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1804))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1805)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false