./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_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_SFH_nondet_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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 17:40:37,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 17:40:37,468 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 17:40:37,474 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 17:40:37,474 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 17:40:37,497 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 17:40:37,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 17:40:37,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 17:40:37,500 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 17:40:37,501 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 17:40:37,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 17:40:37,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 17:40:37,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 17:40:37,502 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 17:40:37,506 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 17:40:37,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 17:40:37,507 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 17:40:37,507 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 17:40:37,507 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 17:40:37,508 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 17:40:37,508 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 17:40:37,508 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 17:40:37,508 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 17:40:37,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 17:40:37,509 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 17:40:37,509 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 17:40:37,509 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 17:40:37,509 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 17:40:37,510 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 17:40:37,510 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 17:40:37,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 17:40:37,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 17:40:37,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 17:40:37,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:40:37,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 17:40:37,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 17:40:37,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 17:40:37,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 17:40:37,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 17:40:37,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 17:40:37,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 17:40:37,518 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 17:40:37,518 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2024-11-10 17:40:37,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 17:40:37,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 17:40:37,766 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 17:40:37,767 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 17:40:37,767 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 17:40:37,768 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-1.i [2024-11-10 17:40:39,051 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 17:40:39,274 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 17:40:39,275 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test4-1.i [2024-11-10 17:40:39,293 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98eda0267/a069b8fc462946f1829b994f014b9ccc/FLAG7460b2fb6 [2024-11-10 17:40:39,308 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98eda0267/a069b8fc462946f1829b994f014b9ccc [2024-11-10 17:40:39,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 17:40:39,312 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 17:40:39,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 17:40:39,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 17:40:39,317 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 17:40:39,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:40:39" (1/1) ... [2024-11-10 17:40:39,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@199573c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:39, skipping insertion in model container [2024-11-10 17:40:39,321 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:40:39" (1/1) ... [2024-11-10 17:40:39,363 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 17:40:39,742 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:40:39,776 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:40:39,781 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:40:39,786 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:40:39,795 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:40:39,834 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:40:39,840 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:40:39,842 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:40:39,845 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:40:39,854 WARN L1072 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-10 17:40:39,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:40:39,868 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 17:40:39,957 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 17:40:39,988 INFO L204 MainTranslator]: Completed translation [2024-11-10 17:40:39,988 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:39 WrapperNode [2024-11-10 17:40:39,988 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 17:40:39,989 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 17:40:39,989 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 17:40:39,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 17:40:39,996 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:40:39" (1/1) ... [2024-11-10 17:40:40,028 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:40:39" (1/1) ... [2024-11-10 17:40:40,092 INFO L138 Inliner]: procedures = 176, calls = 326, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1529 [2024-11-10 17:40:40,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 17:40:40,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 17:40:40,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 17:40:40,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 17:40:40,103 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:39" (1/1) ... [2024-11-10 17:40:40,104 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:39" (1/1) ... [2024-11-10 17:40:40,119 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:39" (1/1) ... [2024-11-10 17:40:40,198 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:40:40,198 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:39" (1/1) ... [2024-11-10 17:40:40,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:39" (1/1) ... [2024-11-10 17:40:40,237 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:39" (1/1) ... [2024-11-10 17:40:40,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:39" (1/1) ... [2024-11-10 17:40:40,248 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:39" (1/1) ... [2024-11-10 17:40:40,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:39" (1/1) ... [2024-11-10 17:40:40,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 17:40:40,262 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 17:40:40,263 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 17:40:40,263 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 17:40:40,264 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:39" (1/1) ... [2024-11-10 17:40:40,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 17:40:40,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:40:40,304 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:40:40,308 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:40:40,357 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-10 17:40:40,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-10 17:40:40,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-10 17:40:40,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-10 17:40:40,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-10 17:40:40,358 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-10 17:40:40,359 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-10 17:40:40,359 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-10 17:40:40,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 17:40:40,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 17:40:40,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 17:40:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-10 17:40:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 17:40:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-10 17:40:40,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 17:40:40,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 17:40:40,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-10 17:40:40,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 17:40:40,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 17:40:40,636 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 17:40:40,638 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 17:40:42,623 INFO L? ?]: Removed 1493 outVars from TransFormulas that were not future-live. [2024-11-10 17:40:42,623 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 17:40:42,691 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 17:40:42,691 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-10 17:40:42,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:40:42 BoogieIcfgContainer [2024-11-10 17:40:42,692 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 17:40:42,694 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 17:40:42,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 17:40:42,697 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 17:40:42,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:40:39" (1/3) ... [2024-11-10 17:40:42,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e299dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:40:42, skipping insertion in model container [2024-11-10 17:40:42,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:40:39" (2/3) ... [2024-11-10 17:40:42,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e299dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:40:42, skipping insertion in model container [2024-11-10 17:40:42,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:40:42" (3/3) ... [2024-11-10 17:40:42,699 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test4-1.i [2024-11-10 17:40:42,713 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 17:40:42,713 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 628 error locations. [2024-11-10 17:40:42,782 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 17:40:42,787 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;@77c75974, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 17:40:42,787 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-11-10 17:40:42,798 INFO L276 IsEmpty]: Start isEmpty. Operand has 1456 states, 826 states have (on average 2.046004842615012) internal successors, (1690), 1448 states have internal predecessors, (1690), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 17:40:42,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-10 17:40:42,804 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:42,805 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-10 17:40:42,806 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:40:42,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:42,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1697619408, now seen corresponding path program 1 times [2024-11-10 17:40:42,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:40:42,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020770066] [2024-11-10 17:40:42,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:42,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:40:42,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:42,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:40:42,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:40:42,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020770066] [2024-11-10 17:40:42,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020770066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:40:42,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:40:42,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:40:42,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650552603] [2024-11-10 17:40:42,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:40:42,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:40:42,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:40:43,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:40:43,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:40:43,015 INFO L87 Difference]: Start difference. First operand has 1456 states, 826 states have (on average 2.046004842615012) internal successors, (1690), 1448 states have internal predecessors, (1690), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:40:43,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:43,872 INFO L93 Difference]: Finished difference Result 1462 states and 1642 transitions. [2024-11-10 17:40:43,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:40:43,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-10 17:40:43,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:43,895 INFO L225 Difference]: With dead ends: 1462 [2024-11-10 17:40:43,895 INFO L226 Difference]: Without dead ends: 1456 [2024-11-10 17:40:43,897 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:40:43,899 INFO L432 NwaCegarLoop]: 1559 mSDtfsCounter, 29 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 718 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 2502 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:43,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 2502 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 718 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 17:40:43,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2024-11-10 17:40:43,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1447. [2024-11-10 17:40:43,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1447 states, 828 states have (on average 1.9565217391304348) internal successors, (1620), 1439 states have internal predecessors, (1620), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 17:40:43,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1447 states to 1447 states and 1632 transitions. [2024-11-10 17:40:43,999 INFO L78 Accepts]: Start accepts. Automaton has 1447 states and 1632 transitions. Word has length 5 [2024-11-10 17:40:43,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:44,000 INFO L471 AbstractCegarLoop]: Abstraction has 1447 states and 1632 transitions. [2024-11-10 17:40:44,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:40:44,000 INFO L276 IsEmpty]: Start isEmpty. Operand 1447 states and 1632 transitions. [2024-11-10 17:40:44,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 17:40:44,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:44,001 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:40:44,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 17:40:44,001 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr626REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:40:44,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:44,002 INFO L85 PathProgramCache]: Analyzing trace with hash -620279345, now seen corresponding path program 1 times [2024-11-10 17:40:44,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:40:44,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698398532] [2024-11-10 17:40:44,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:44,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:40:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:44,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:40:44,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:40:44,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698398532] [2024-11-10 17:40:44,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698398532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:40:44,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:40:44,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:40:44,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128730206] [2024-11-10 17:40:44,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:40:44,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:40:44,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:40:44,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:40:44,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:40:44,105 INFO L87 Difference]: Start difference. First operand 1447 states and 1632 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:40:44,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:44,880 INFO L93 Difference]: Finished difference Result 1353 states and 1536 transitions. [2024-11-10 17:40:44,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:40:44,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-11-10 17:40:44,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:44,885 INFO L225 Difference]: With dead ends: 1353 [2024-11-10 17:40:44,885 INFO L226 Difference]: Without dead ends: 1353 [2024-11-10 17:40:44,885 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:40:44,886 INFO L432 NwaCegarLoop]: 858 mSDtfsCounter, 1372 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 778 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:44,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 868 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 778 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 17:40:44,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2024-11-10 17:40:44,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1353. [2024-11-10 17:40:44,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 828 states have (on average 1.8405797101449275) internal successors, (1524), 1345 states have internal predecessors, (1524), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 17:40:44,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1536 transitions. [2024-11-10 17:40:44,909 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1536 transitions. Word has length 7 [2024-11-10 17:40:44,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:44,909 INFO L471 AbstractCegarLoop]: Abstraction has 1353 states and 1536 transitions. [2024-11-10 17:40:44,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:40:44,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1536 transitions. [2024-11-10 17:40:44,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-10 17:40:44,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:44,910 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:40:44,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 17:40:44,910 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr627REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:40:44,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:44,911 INFO L85 PathProgramCache]: Analyzing trace with hash -620279344, now seen corresponding path program 1 times [2024-11-10 17:40:44,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:40:44,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844866564] [2024-11-10 17:40:44,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:44,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:40:44,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:45,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:40:45,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:40:45,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844866564] [2024-11-10 17:40:45,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844866564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:40:45,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:40:45,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 17:40:45,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082783244] [2024-11-10 17:40:45,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:40:45,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:40:45,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:40:45,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:40:45,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:40:45,049 INFO L87 Difference]: Start difference. First operand 1353 states and 1536 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:40:45,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:45,920 INFO L93 Difference]: Finished difference Result 1777 states and 2038 transitions. [2024-11-10 17:40:45,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:40:45,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-11-10 17:40:45,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:45,926 INFO L225 Difference]: With dead ends: 1777 [2024-11-10 17:40:45,926 INFO L226 Difference]: Without dead ends: 1777 [2024-11-10 17:40:45,927 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:40:45,928 INFO L432 NwaCegarLoop]: 1226 mSDtfsCounter, 831 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 1841 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:45,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 1841 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 17:40:45,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2024-11-10 17:40:45,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1623. [2024-11-10 17:40:45,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1623 states, 1108 states have (on average 1.80956678700361) internal successors, (2005), 1615 states have internal predecessors, (2005), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-10 17:40:45,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1623 states to 1623 states and 2017 transitions. [2024-11-10 17:40:45,954 INFO L78 Accepts]: Start accepts. Automaton has 1623 states and 2017 transitions. Word has length 7 [2024-11-10 17:40:45,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:45,955 INFO L471 AbstractCegarLoop]: Abstraction has 1623 states and 2017 transitions. [2024-11-10 17:40:45,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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:40:45,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1623 states and 2017 transitions. [2024-11-10 17:40:45,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 17:40:45,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:45,955 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:40:45,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 17:40:45,955 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:40:45,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:45,956 INFO L85 PathProgramCache]: Analyzing trace with hash 858095659, now seen corresponding path program 1 times [2024-11-10 17:40:45,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:40:45,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451083535] [2024-11-10 17:40:45,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:45,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:40:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:46,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:40:46,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:40:46,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451083535] [2024-11-10 17:40:46,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451083535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:40:46,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:40:46,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:40:46,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704111116] [2024-11-10 17:40:46,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:40:46,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:40:46,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:40:46,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:40:46,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:40:46,035 INFO L87 Difference]: Start difference. First operand 1623 states and 2017 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:40:46,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:46,421 INFO L93 Difference]: Finished difference Result 2691 states and 3382 transitions. [2024-11-10 17:40:46,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:40:46,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-10 17:40:46,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:46,431 INFO L225 Difference]: With dead ends: 2691 [2024-11-10 17:40:46,432 INFO L226 Difference]: Without dead ends: 2688 [2024-11-10 17:40:46,432 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:40:46,436 INFO L432 NwaCegarLoop]: 1458 mSDtfsCounter, 1008 mSDsluCounter, 2681 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1011 SdHoareTripleChecker+Valid, 4139 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:46,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1011 Valid, 4139 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 17:40:46,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2024-11-10 17:40:46,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 2389. [2024-11-10 17:40:46,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2389 states, 1874 states have (on average 1.7934898612593384) internal successors, (3361), 2378 states have internal predecessors, (3361), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:40:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 3379 transitions. [2024-11-10 17:40:46,510 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 3379 transitions. Word has length 9 [2024-11-10 17:40:46,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:46,510 INFO L471 AbstractCegarLoop]: Abstraction has 2389 states and 3379 transitions. [2024-11-10 17:40:46,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:40:46,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 3379 transitions. [2024-11-10 17:40:46,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 17:40:46,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:46,511 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:40:46,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 17:40:46,512 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr622REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:40:46,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:46,512 INFO L85 PathProgramCache]: Analyzing trace with hash -131339220, now seen corresponding path program 1 times [2024-11-10 17:40:46,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:40:46,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685532788] [2024-11-10 17:40:46,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:46,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:40:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:46,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:40:46,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:40:46,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685532788] [2024-11-10 17:40:46,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685532788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:40:46,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:40:46,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:40:46,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743873766] [2024-11-10 17:40:46,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:40:46,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:40:46,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:40:46,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:40:46,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:40:46,581 INFO L87 Difference]: Start difference. First operand 2389 states and 3379 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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:40:47,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:47,541 INFO L93 Difference]: Finished difference Result 2464 states and 3485 transitions. [2024-11-10 17:40:47,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:40:47,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-11-10 17:40:47,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:47,549 INFO L225 Difference]: With dead ends: 2464 [2024-11-10 17:40:47,549 INFO L226 Difference]: Without dead ends: 2464 [2024-11-10 17:40:47,550 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:40:47,551 INFO L432 NwaCegarLoop]: 832 mSDtfsCounter, 1640 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1400 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1646 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:47,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1646 Valid, 1535 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1400 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 17:40:47,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2024-11-10 17:40:47,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 2366. [2024-11-10 17:40:47,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2366 states, 1874 states have (on average 1.7689434364994663) internal successors, (3315), 2355 states have internal predecessors, (3315), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:40:47,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 3333 transitions. [2024-11-10 17:40:47,599 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 3333 transitions. Word has length 14 [2024-11-10 17:40:47,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:47,600 INFO L471 AbstractCegarLoop]: Abstraction has 2366 states and 3333 transitions. [2024-11-10 17:40:47,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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:40:47,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 3333 transitions. [2024-11-10 17:40:47,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-10 17:40:47,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:47,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:40:47,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 17:40:47,602 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr623REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:40:47,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:47,602 INFO L85 PathProgramCache]: Analyzing trace with hash -131339219, now seen corresponding path program 1 times [2024-11-10 17:40:47,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:40:47,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904245187] [2024-11-10 17:40:47,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:47,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:40:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:47,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:40:47,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:40:47,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904245187] [2024-11-10 17:40:47,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904245187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:40:47,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:40:47,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:40:47,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571135887] [2024-11-10 17:40:47,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:40:47,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:40:47,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:40:47,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:40:47,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:40:47,717 INFO L87 Difference]: Start difference. First operand 2366 states and 3333 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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:40:48,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:48,912 INFO L93 Difference]: Finished difference Result 2836 states and 3804 transitions. [2024-11-10 17:40:48,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 17:40:48,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2024-11-10 17:40:48,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:48,919 INFO L225 Difference]: With dead ends: 2836 [2024-11-10 17:40:48,920 INFO L226 Difference]: Without dead ends: 2836 [2024-11-10 17:40:48,920 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:40:48,921 INFO L432 NwaCegarLoop]: 1294 mSDtfsCounter, 1245 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 1544 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 1566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:48,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1245 Valid, 2791 Invalid, 1566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1544 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 17:40:48,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2836 states. [2024-11-10 17:40:48,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2836 to 2484. [2024-11-10 17:40:48,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2484 states, 1992 states have (on average 1.7354417670682731) internal successors, (3457), 2473 states have internal predecessors, (3457), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:40:48,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2484 states to 2484 states and 3475 transitions. [2024-11-10 17:40:48,963 INFO L78 Accepts]: Start accepts. Automaton has 2484 states and 3475 transitions. Word has length 14 [2024-11-10 17:40:48,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:48,964 INFO L471 AbstractCegarLoop]: Abstraction has 2484 states and 3475 transitions. [2024-11-10 17:40:48,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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:40:48,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2484 states and 3475 transitions. [2024-11-10 17:40:48,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-10 17:40:48,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:48,967 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:40:48,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 17:40:48,967 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr623REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:40:48,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:48,968 INFO L85 PathProgramCache]: Analyzing trace with hash 549338573, now seen corresponding path program 1 times [2024-11-10 17:40:48,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:40:48,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825270493] [2024-11-10 17:40:48,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:48,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:40:49,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:49,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-10 17:40:49,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:40:49,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825270493] [2024-11-10 17:40:49,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825270493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:40:49,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:40:49,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:40:49,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194062737] [2024-11-10 17:40:49,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:40:49,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:40:49,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:40:49,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:40:49,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:40:49,123 INFO L87 Difference]: Start difference. First operand 2484 states and 3475 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:40:49,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:49,196 INFO L93 Difference]: Finished difference Result 2217 states and 3105 transitions. [2024-11-10 17:40:49,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:40:49,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-11-10 17:40:49,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:49,203 INFO L225 Difference]: With dead ends: 2217 [2024-11-10 17:40:49,203 INFO L226 Difference]: Without dead ends: 2217 [2024-11-10 17:40:49,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:40:49,204 INFO L432 NwaCegarLoop]: 1320 mSDtfsCounter, 51 mSDsluCounter, 1276 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 2596 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:40:49,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 2596 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:40:49,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2217 states. [2024-11-10 17:40:49,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2217 to 2217. [2024-11-10 17:40:49,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2217 states, 1748 states have (on average 1.7660183066361557) internal successors, (3087), 2206 states have internal predecessors, (3087), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:40:49,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 3105 transitions. [2024-11-10 17:40:49,239 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 3105 transitions. Word has length 52 [2024-11-10 17:40:49,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:49,239 INFO L471 AbstractCegarLoop]: Abstraction has 2217 states and 3105 transitions. [2024-11-10 17:40:49,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:40:49,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 3105 transitions. [2024-11-10 17:40:49,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-10 17:40:49,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:49,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:40:49,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 17:40:49,241 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr570REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:40:49,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:49,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1452084582, now seen corresponding path program 1 times [2024-11-10 17:40:49,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:40:49,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825526501] [2024-11-10 17:40:49,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:49,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:40:49,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:49,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:40:49,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:40:49,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825526501] [2024-11-10 17:40:49,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825526501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:40:49,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:40:49,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:40:49,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129639580] [2024-11-10 17:40:49,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:40:49,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 17:40:49,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:40:49,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 17:40:49,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 17:40:49,328 INFO L87 Difference]: Start difference. First operand 2217 states and 3105 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:40:49,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:49,439 INFO L93 Difference]: Finished difference Result 2243 states and 3123 transitions. [2024-11-10 17:40:49,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:40:49,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-11-10 17:40:49,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:49,446 INFO L225 Difference]: With dead ends: 2243 [2024-11-10 17:40:49,446 INFO L226 Difference]: Without dead ends: 2243 [2024-11-10 17:40:49,447 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:40:49,447 INFO L432 NwaCegarLoop]: 1312 mSDtfsCounter, 56 mSDsluCounter, 2550 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 3862 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:49,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 3862 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:40:49,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2243 states. [2024-11-10 17:40:49,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2243 to 2241. [2024-11-10 17:40:49,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2241 states, 1772 states have (on average 1.7511286681715577) internal successors, (3103), 2230 states have internal predecessors, (3103), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:40:49,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2241 states to 2241 states and 3121 transitions. [2024-11-10 17:40:49,502 INFO L78 Accepts]: Start accepts. Automaton has 2241 states and 3121 transitions. Word has length 65 [2024-11-10 17:40:49,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:49,502 INFO L471 AbstractCegarLoop]: Abstraction has 2241 states and 3121 transitions. [2024-11-10 17:40:49,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 17:40:49,502 INFO L276 IsEmpty]: Start isEmpty. Operand 2241 states and 3121 transitions. [2024-11-10 17:40:49,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-10 17:40:49,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:49,504 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:40:49,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 17:40:49,504 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr570REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:40:49,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:49,505 INFO L85 PathProgramCache]: Analyzing trace with hash -2117113826, now seen corresponding path program 1 times [2024-11-10 17:40:49,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:40:49,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459764518] [2024-11-10 17:40:49,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:49,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:40:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:49,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:40:49,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:40:49,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459764518] [2024-11-10 17:40:49,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459764518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:40:49,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:40:49,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 17:40:49,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728590627] [2024-11-10 17:40:49,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:40:49,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 17:40:49,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:40:49,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 17:40:49,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 17:40:49,601 INFO L87 Difference]: Start difference. First operand 2241 states and 3121 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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:40:49,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:49,680 INFO L93 Difference]: Finished difference Result 2005 states and 2713 transitions. [2024-11-10 17:40:49,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 17:40:49,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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 73 [2024-11-10 17:40:49,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:49,686 INFO L225 Difference]: With dead ends: 2005 [2024-11-10 17:40:49,686 INFO L226 Difference]: Without dead ends: 2005 [2024-11-10 17:40:49,686 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:40:49,687 INFO L432 NwaCegarLoop]: 1327 mSDtfsCounter, 75 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 2626 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:40:49,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 2626 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 17:40:49,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2024-11-10 17:40:49,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 2005. [2024-11-10 17:40:49,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2005 states, 1536 states have (on average 1.7545572916666667) internal successors, (2695), 1994 states have internal predecessors, (2695), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:40:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 2713 transitions. [2024-11-10 17:40:49,710 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 2713 transitions. Word has length 73 [2024-11-10 17:40:49,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:49,711 INFO L471 AbstractCegarLoop]: Abstraction has 2005 states and 2713 transitions. [2024-11-10 17:40:49,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 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:40:49,711 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2713 transitions. [2024-11-10 17:40:49,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-10 17:40:49,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:49,712 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] [2024-11-10 17:40:49,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 17:40:49,713 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr541REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:40:49,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:49,713 INFO L85 PathProgramCache]: Analyzing trace with hash 655748320, now seen corresponding path program 1 times [2024-11-10 17:40:49,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:40:49,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569326726] [2024-11-10 17:40:49,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:49,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:40:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:50,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:40:50,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:40:50,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569326726] [2024-11-10 17:40:50,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569326726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:40:50,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:40:50,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 17:40:50,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762600704] [2024-11-10 17:40:50,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:40:50,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 17:40:50,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:40:50,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 17:40:50,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-10 17:40:50,066 INFO L87 Difference]: Start difference. First operand 2005 states and 2713 transitions. Second operand has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 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:40:51,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:51,172 INFO L93 Difference]: Finished difference Result 1921 states and 2588 transitions. [2024-11-10 17:40:51,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 17:40:51,172 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 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 76 [2024-11-10 17:40:51,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:51,177 INFO L225 Difference]: With dead ends: 1921 [2024-11-10 17:40:51,177 INFO L226 Difference]: Without dead ends: 1921 [2024-11-10 17:40:51,177 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:40:51,177 INFO L432 NwaCegarLoop]: 572 mSDtfsCounter, 2310 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 2164 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2316 SdHoareTripleChecker+Valid, 1577 SdHoareTripleChecker+Invalid, 2268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:51,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2316 Valid, 1577 Invalid, 2268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2164 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 17:40:51,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2024-11-10 17:40:51,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1641. [2024-11-10 17:40:51,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1641 states, 1256 states have (on average 1.6552547770700636) internal successors, (2079), 1630 states have internal predecessors, (2079), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:40:51,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1641 states to 1641 states and 2097 transitions. [2024-11-10 17:40:51,198 INFO L78 Accepts]: Start accepts. Automaton has 1641 states and 2097 transitions. Word has length 76 [2024-11-10 17:40:51,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:51,198 INFO L471 AbstractCegarLoop]: Abstraction has 1641 states and 2097 transitions. [2024-11-10 17:40:51,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.2) internal successors, (76), 6 states have internal predecessors, (76), 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:40:51,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1641 states and 2097 transitions. [2024-11-10 17:40:51,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 17:40:51,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:51,199 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] [2024-11-10 17:40:51,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 17:40:51,199 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr534REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:40:51,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:51,200 INFO L85 PathProgramCache]: Analyzing trace with hash 2106872745, now seen corresponding path program 1 times [2024-11-10 17:40:51,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:40:51,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627856774] [2024-11-10 17:40:51,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:51,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:40:51,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:51,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:40:51,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:40:51,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627856774] [2024-11-10 17:40:51,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627856774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:40:51,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:40:51,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:40:51,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298236139] [2024-11-10 17:40:51,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:40:51,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:40:51,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:40:51,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:40:51,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:40:51,395 INFO L87 Difference]: Start difference. First operand 1641 states and 2097 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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:40:52,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:52,265 INFO L93 Difference]: Finished difference Result 1640 states and 2095 transitions. [2024-11-10 17:40:52,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:40:52,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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 81 [2024-11-10 17:40:52,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:52,271 INFO L225 Difference]: With dead ends: 1640 [2024-11-10 17:40:52,271 INFO L226 Difference]: Without dead ends: 1640 [2024-11-10 17:40:52,271 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:40:52,271 INFO L432 NwaCegarLoop]: 1239 mSDtfsCounter, 2 mSDsluCounter, 2230 mSDsCounter, 0 mSdLazyCounter, 1634 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3469 SdHoareTripleChecker+Invalid, 1635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:52,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3469 Invalid, 1635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1634 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 17:40:52,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2024-11-10 17:40:52,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1640. [2024-11-10 17:40:52,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1256 states have (on average 1.6536624203821657) internal successors, (2077), 1629 states have internal predecessors, (2077), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:40:52,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 2095 transitions. [2024-11-10 17:40:52,292 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 2095 transitions. Word has length 81 [2024-11-10 17:40:52,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:52,292 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 2095 transitions. [2024-11-10 17:40:52,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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:40:52,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2095 transitions. [2024-11-10 17:40:52,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-10 17:40:52,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:52,293 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] [2024-11-10 17:40:52,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 17:40:52,293 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr535REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:40:52,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:52,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2106872746, now seen corresponding path program 1 times [2024-11-10 17:40:52,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:40:52,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333841029] [2024-11-10 17:40:52,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:52,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:40:52,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:52,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:40:52,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:40:52,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333841029] [2024-11-10 17:40:52,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333841029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:40:52,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:40:52,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 17:40:52,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926355300] [2024-11-10 17:40:52,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:40:52,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 17:40:52,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:40:52,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 17:40:52,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 17:40:52,614 INFO L87 Difference]: Start difference. First operand 1640 states and 2095 transitions. Second operand has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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:40:53,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:53,490 INFO L93 Difference]: Finished difference Result 1639 states and 2093 transitions. [2024-11-10 17:40:53,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:40:53,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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 81 [2024-11-10 17:40:53,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:53,494 INFO L225 Difference]: With dead ends: 1639 [2024-11-10 17:40:53,494 INFO L226 Difference]: Without dead ends: 1639 [2024-11-10 17:40:53,495 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:40:53,495 INFO L432 NwaCegarLoop]: 1239 mSDtfsCounter, 1 mSDsluCounter, 2251 mSDsCounter, 0 mSdLazyCounter, 1610 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3490 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:53,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3490 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1610 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 17:40:53,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2024-11-10 17:40:53,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1639. [2024-11-10 17:40:53,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1254 states have (on average 1.6547049441786283) internal successors, (2075), 1628 states have internal predecessors, (2075), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:40:53,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2093 transitions. [2024-11-10 17:40:53,514 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2093 transitions. Word has length 81 [2024-11-10 17:40:53,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:53,515 INFO L471 AbstractCegarLoop]: Abstraction has 1639 states and 2093 transitions. [2024-11-10 17:40:53,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.25) internal successors, (81), 5 states have internal predecessors, (81), 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:40:53,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2093 transitions. [2024-11-10 17:40:53,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 17:40:53,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:53,516 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:40:53,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 17:40:53,516 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr530REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:40:53,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:53,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1350926054, now seen corresponding path program 1 times [2024-11-10 17:40:53,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:40:53,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219109492] [2024-11-10 17:40:53,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:53,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:40:53,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:53,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:40:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:53,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:40:53,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:40:53,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219109492] [2024-11-10 17:40:53,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219109492] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:40:53,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:40:53,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:40:53,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131536632] [2024-11-10 17:40:53,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:40:53,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:40:53,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:40:53,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:40:53,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:40:53,739 INFO L87 Difference]: Start difference. First operand 1639 states and 2093 transitions. Second operand has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:40:54,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:54,913 INFO L93 Difference]: Finished difference Result 1657 states and 2123 transitions. [2024-11-10 17:40:54,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 17:40:54,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 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 89 [2024-11-10 17:40:54,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:54,921 INFO L225 Difference]: With dead ends: 1657 [2024-11-10 17:40:54,922 INFO L226 Difference]: Without dead ends: 1657 [2024-11-10 17:40:54,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 17:40:54,924 INFO L432 NwaCegarLoop]: 1228 mSDtfsCounter, 10 mSDsluCounter, 4162 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5390 SdHoareTripleChecker+Invalid, 2268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:54,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5390 Invalid, 2268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 17:40:54,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1657 states. [2024-11-10 17:40:54,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1657 to 1648. [2024-11-10 17:40:54,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1262 states have (on average 1.6529318541996831) internal successors, (2086), 1635 states have internal predecessors, (2086), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-10 17:40:54,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2113 transitions. [2024-11-10 17:40:54,948 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2113 transitions. Word has length 89 [2024-11-10 17:40:54,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:54,948 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2113 transitions. [2024-11-10 17:40:54,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:40:54,948 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2113 transitions. [2024-11-10 17:40:54,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-10 17:40:54,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:54,949 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:40:54,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 17:40:54,949 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr531REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:40:54,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:54,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1350926055, now seen corresponding path program 1 times [2024-11-10 17:40:54,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:40:54,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254959121] [2024-11-10 17:40:54,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:54,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:40:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:55,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:40:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:55,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:40:55,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:40:55,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254959121] [2024-11-10 17:40:55,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254959121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:40:55,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:40:55,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 17:40:55,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550460489] [2024-11-10 17:40:55,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:40:55,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 17:40:55,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:40:55,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 17:40:55,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 17:40:55,346 INFO L87 Difference]: Start difference. First operand 1648 states and 2113 transitions. Second operand has 7 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:40:56,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:56,289 INFO L93 Difference]: Finished difference Result 1648 states and 2111 transitions. [2024-11-10 17:40:56,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 17:40:56,289 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 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 89 [2024-11-10 17:40:56,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:56,293 INFO L225 Difference]: With dead ends: 1648 [2024-11-10 17:40:56,293 INFO L226 Difference]: Without dead ends: 1648 [2024-11-10 17:40:56,293 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:40:56,293 INFO L432 NwaCegarLoop]: 1235 mSDtfsCounter, 5 mSDsluCounter, 3277 mSDsCounter, 0 mSdLazyCounter, 1859 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4512 SdHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:56,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 4512 Invalid, 1869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1859 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 17:40:56,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2024-11-10 17:40:56,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1648. [2024-11-10 17:40:56,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1648 states, 1262 states have (on average 1.6513470681458002) internal successors, (2084), 1635 states have internal predecessors, (2084), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-10 17:40:56,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2111 transitions. [2024-11-10 17:40:56,310 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2111 transitions. Word has length 89 [2024-11-10 17:40:56,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:56,311 INFO L471 AbstractCegarLoop]: Abstraction has 1648 states and 2111 transitions. [2024-11-10 17:40:56,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:40:56,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2111 transitions. [2024-11-10 17:40:56,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-10 17:40:56,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:56,311 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] [2024-11-10 17:40:56,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 17:40:56,312 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:40:56,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:56,312 INFO L85 PathProgramCache]: Analyzing trace with hash 639547670, now seen corresponding path program 1 times [2024-11-10 17:40:56,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:40:56,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667348434] [2024-11-10 17:40:56,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:56,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:40:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:56,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:40:56,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:56,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:40:56,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:40:56,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667348434] [2024-11-10 17:40:56,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667348434] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:40:56,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778019692] [2024-11-10 17:40:56,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:56,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:40:56,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:40:56,722 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:40:56,726 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:40:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:56,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 17:40:56,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:40:56,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 17:40:57,074 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:40:57,075 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:40:57,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-10 17:40:57,158 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:40:57,159 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:40:57,188 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:40:57,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:40:57,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:40:57,228 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-10 17:40:57,228 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:40:57,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778019692] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:40:57,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:40:57,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 14 [2024-11-10 17:40:57,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883131291] [2024-11-10 17:40:57,267 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:40:57,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 17:40:57,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:40:57,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 17:40:57,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=196, Unknown=6, NotChecked=0, Total=240 [2024-11-10 17:40:57,269 INFO L87 Difference]: Start difference. First operand 1648 states and 2111 transitions. Second operand has 15 states, 13 states have (on average 9.923076923076923) internal successors, (129), 13 states have internal predecessors, (129), 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:40:59,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:40:59,050 INFO L93 Difference]: Finished difference Result 1647 states and 2109 transitions. [2024-11-10 17:40:59,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:40:59,051 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 9.923076923076923) internal successors, (129), 13 states have internal predecessors, (129), 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 90 [2024-11-10 17:40:59,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:40:59,054 INFO L225 Difference]: With dead ends: 1647 [2024-11-10 17:40:59,054 INFO L226 Difference]: Without dead ends: 1647 [2024-11-10 17:40:59,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=452, Unknown=7, NotChecked=0, Total=552 [2024-11-10 17:40:59,055 INFO L432 NwaCegarLoop]: 747 mSDtfsCounter, 1194 mSDsluCounter, 5764 mSDsCounter, 0 mSdLazyCounter, 4896 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 6511 SdHoareTripleChecker+Invalid, 4922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 4896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:40:59,055 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 6511 Invalid, 4922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 4896 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 17:40:59,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1647 states. [2024-11-10 17:40:59,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1647 to 1647. [2024-11-10 17:40:59,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1647 states, 1262 states have (on average 1.6497622820919176) internal successors, (2082), 1634 states have internal predecessors, (2082), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-10 17:40:59,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 2109 transitions. [2024-11-10 17:40:59,075 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 2109 transitions. Word has length 90 [2024-11-10 17:40:59,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:40:59,075 INFO L471 AbstractCegarLoop]: Abstraction has 1647 states and 2109 transitions. [2024-11-10 17:40:59,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 9.923076923076923) internal successors, (129), 13 states have internal predecessors, (129), 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:40:59,075 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 2109 transitions. [2024-11-10 17:40:59,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-10 17:40:59,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:40:59,076 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] [2024-11-10 17:40:59,117 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:40:59,276 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,SelfDestructingSolverStorable14 [2024-11-10 17:40:59,277 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr531REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:40:59,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:40:59,277 INFO L85 PathProgramCache]: Analyzing trace with hash 639547671, now seen corresponding path program 1 times [2024-11-10 17:40:59,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:40:59,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655817728] [2024-11-10 17:40:59,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:59,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:40:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:59,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:40:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:40:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:40:59,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:40:59,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655817728] [2024-11-10 17:40:59,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655817728] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:40:59,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928097548] [2024-11-10 17:40:59,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:40:59,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:40:59,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:40:59,858 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:40:59,860 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:41:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:00,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-10 17:41:00,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:41:00,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:41:00,131 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:41:00,131 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:41:00,137 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:41:00,158 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:41:00,163 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:41:00,230 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:41:00,233 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:41:00,328 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:41:00,328 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:41:00,333 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:41:00,372 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:41:00,377 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:41:00,393 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:41:00,393 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:41:00,474 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_628 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_628) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_628 (Array Int Int))) (<= (+ 20 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_628) |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_629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-10 17:41:00,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928097548] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:41:00,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:41:00,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-10 17:41:00,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036426479] [2024-11-10 17:41:00,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:41:00,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-10 17:41:00,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:41:00,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-10 17:41:00,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2024-11-10 17:41:00,477 INFO L87 Difference]: Start difference. First operand 1647 states and 2109 transitions. Second operand has 19 states, 16 states have (on average 8.75) internal successors, (140), 18 states have internal predecessors, (140), 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:41:02,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:41:02,779 INFO L93 Difference]: Finished difference Result 1654 states and 2115 transitions. [2024-11-10 17:41:02,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 17:41:02,779 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.75) internal successors, (140), 18 states have internal predecessors, (140), 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 90 [2024-11-10 17:41:02,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:41:02,782 INFO L225 Difference]: With dead ends: 1654 [2024-11-10 17:41:02,782 INFO L226 Difference]: Without dead ends: 1654 [2024-11-10 17:41:02,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=103, Invalid=550, Unknown=1, NotChecked=48, Total=702 [2024-11-10 17:41:02,782 INFO L432 NwaCegarLoop]: 752 mSDtfsCounter, 1233 mSDsluCounter, 4190 mSDsCounter, 0 mSdLazyCounter, 5245 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 4942 SdHoareTripleChecker+Invalid, 5276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 5245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-10 17:41:02,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1243 Valid, 4942 Invalid, 5276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 5245 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-10 17:41:02,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2024-11-10 17:41:02,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1642. [2024-11-10 17:41:02,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1258 states have (on average 1.6502384737678855) internal successors, (2076), 1630 states have internal predecessors, (2076), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:41:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 2094 transitions. [2024-11-10 17:41:02,800 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 2094 transitions. Word has length 90 [2024-11-10 17:41:02,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:41:02,800 INFO L471 AbstractCegarLoop]: Abstraction has 1642 states and 2094 transitions. [2024-11-10 17:41:02,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.75) internal successors, (140), 18 states have internal predecessors, (140), 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:41:02,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2094 transitions. [2024-11-10 17:41:02,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 17:41:02,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:41:02,802 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:41:02,821 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:41:03,002 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,SelfDestructingSolverStorable15 [2024-11-10 17:41:03,003 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr526REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:41:03,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:41:03,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1595807953, now seen corresponding path program 1 times [2024-11-10 17:41:03,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:41:03,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391566548] [2024-11-10 17:41:03,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:41:03,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:41:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:03,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:41:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:03,436 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:41:03,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:41:03,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391566548] [2024-11-10 17:41:03,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391566548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:41:03,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:41:03,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 17:41:03,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084364355] [2024-11-10 17:41:03,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:41:03,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 17:41:03,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:41:03,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 17:41:03,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-10 17:41:03,438 INFO L87 Difference]: Start difference. First operand 1642 states and 2094 transitions. Second operand has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 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:41:05,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:41:05,155 INFO L93 Difference]: Finished difference Result 1661 states and 2123 transitions. [2024-11-10 17:41:05,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 17:41:05,156 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 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 92 [2024-11-10 17:41:05,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:41:05,159 INFO L225 Difference]: With dead ends: 1661 [2024-11-10 17:41:05,160 INFO L226 Difference]: Without dead ends: 1661 [2024-11-10 17:41:05,160 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:41:05,162 INFO L432 NwaCegarLoop]: 746 mSDtfsCounter, 1262 mSDsluCounter, 5084 mSDsCounter, 0 mSdLazyCounter, 4371 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1272 SdHoareTripleChecker+Valid, 5830 SdHoareTripleChecker+Invalid, 4392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:41:05,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1272 Valid, 5830 Invalid, 4392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4371 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 17:41:05,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2024-11-10 17:41:05,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1657. [2024-11-10 17:41:05,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1272 states have (on average 1.645440251572327) internal successors, (2093), 1643 states have internal predecessors, (2093), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-10 17:41:05,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2113 transitions. [2024-11-10 17:41:05,179 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2113 transitions. Word has length 92 [2024-11-10 17:41:05,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:41:05,179 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2113 transitions. [2024-11-10 17:41:05,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.5) internal successors, (90), 13 states have internal predecessors, (90), 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:41:05,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2113 transitions. [2024-11-10 17:41:05,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-10 17:41:05,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:41:05,180 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:41:05,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 17:41:05,180 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr527REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:41:05,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:41:05,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1595807954, now seen corresponding path program 1 times [2024-11-10 17:41:05,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:41:05,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762039319] [2024-11-10 17:41:05,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:41:05,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:41:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:05,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:41:05,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:05,764 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:41:05,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:41:05,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762039319] [2024-11-10 17:41:05,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762039319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:41:05,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:41:05,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 17:41:05,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833497478] [2024-11-10 17:41:05,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:41:05,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 17:41:05,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:41:05,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 17:41:05,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-10 17:41:05,767 INFO L87 Difference]: Start difference. First operand 1657 states and 2113 transitions. Second operand has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 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:41:07,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:41:07,941 INFO L93 Difference]: Finished difference Result 1660 states and 2121 transitions. [2024-11-10 17:41:07,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 17:41:07,941 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 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 92 [2024-11-10 17:41:07,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:41:07,944 INFO L225 Difference]: With dead ends: 1660 [2024-11-10 17:41:07,944 INFO L226 Difference]: Without dead ends: 1660 [2024-11-10 17:41:07,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-10 17:41:07,945 INFO L432 NwaCegarLoop]: 753 mSDtfsCounter, 1216 mSDsluCounter, 4926 mSDsCounter, 0 mSdLazyCounter, 5767 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1226 SdHoareTripleChecker+Valid, 5679 SdHoareTripleChecker+Invalid, 5786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 5767 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-10 17:41:07,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1226 Valid, 5679 Invalid, 5786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 5767 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-10 17:41:07,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2024-11-10 17:41:07,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1657. [2024-11-10 17:41:07,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1272 states have (on average 1.6438679245283019) internal successors, (2091), 1643 states have internal predecessors, (2091), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-10 17:41:07,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2111 transitions. [2024-11-10 17:41:07,960 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2111 transitions. Word has length 92 [2024-11-10 17:41:07,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:41:07,960 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2111 transitions. [2024-11-10 17:41:07,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 11 states have internal predecessors, (90), 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:41:07,960 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2111 transitions. [2024-11-10 17:41:07,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 17:41:07,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:41:07,961 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] [2024-11-10 17:41:07,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 17:41:07,961 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:41:07,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:41:07,962 INFO L85 PathProgramCache]: Analyzing trace with hash 291008673, now seen corresponding path program 1 times [2024-11-10 17:41:07,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:41:07,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682993285] [2024-11-10 17:41:07,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:41:07,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:41:07,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:08,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:41:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:08,381 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:41:08,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:41:08,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682993285] [2024-11-10 17:41:08,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682993285] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:41:08,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465067876] [2024-11-10 17:41:08,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:41:08,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:41:08,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:41:08,383 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:41:08,384 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:41:08,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:08,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 17:41:08,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:41:08,582 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:41:08,670 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:41:08,670 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:41:08,676 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:41:08,729 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:41:08,729 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:41:08,770 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:41:08,771 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:41:08,783 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:41:08,787 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:41:08,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:41:08,797 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_884 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_884) |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:41:08,859 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-10 17:41:08,859 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:41:08,865 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_887 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (= (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~mem50#1.base| v_ArrVal_887))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_884)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-10 17:41:08,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465067876] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:41:08,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:41:08,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 16 [2024-11-10 17:41:08,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462071601] [2024-11-10 17:41:08,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:41:08,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 17:41:08,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:41:08,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 17:41:08,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=252, Unknown=10, NotChecked=66, Total=380 [2024-11-10 17:41:08,868 INFO L87 Difference]: Start difference. First operand 1657 states and 2111 transitions. Second operand has 17 states, 15 states have (on average 8.933333333333334) internal successors, (134), 15 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:41:10,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:41:10,972 INFO L93 Difference]: Finished difference Result 1659 states and 2119 transitions. [2024-11-10 17:41:10,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:41:10,973 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 8.933333333333334) internal successors, (134), 15 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-10 17:41:10,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:41:10,976 INFO L225 Difference]: With dead ends: 1659 [2024-11-10 17:41:10,976 INFO L226 Difference]: Without dead ends: 1659 [2024-11-10 17:41:10,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=536, Unknown=10, NotChecked=98, Total=756 [2024-11-10 17:41:10,977 INFO L432 NwaCegarLoop]: 746 mSDtfsCounter, 1188 mSDsluCounter, 7214 mSDsCounter, 0 mSdLazyCounter, 5971 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1198 SdHoareTripleChecker+Valid, 7960 SdHoareTripleChecker+Invalid, 5991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:41:10,977 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1198 Valid, 7960 Invalid, 5991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 5971 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-10 17:41:10,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2024-11-10 17:41:10,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1656. [2024-11-10 17:41:10,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1272 states have (on average 1.6422955974842768) internal successors, (2089), 1642 states have internal predecessors, (2089), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-10 17:41:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2109 transitions. [2024-11-10 17:41:10,993 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2109 transitions. Word has length 93 [2024-11-10 17:41:10,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:41:10,994 INFO L471 AbstractCegarLoop]: Abstraction has 1656 states and 2109 transitions. [2024-11-10 17:41:10,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 8.933333333333334) internal successors, (134), 15 states have internal predecessors, (134), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:41:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2109 transitions. [2024-11-10 17:41:10,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-10 17:41:10,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:41:10,995 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] [2024-11-10 17:41:11,012 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 17:41:11,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:41:11,196 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr527REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:41:11,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:41:11,197 INFO L85 PathProgramCache]: Analyzing trace with hash 291008674, now seen corresponding path program 1 times [2024-11-10 17:41:11,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:41:11,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304887844] [2024-11-10 17:41:11,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:41:11,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:41:11,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:11,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:41:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:11,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:41:11,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:41:11,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304887844] [2024-11-10 17:41:11,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304887844] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:41:11,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286146389] [2024-11-10 17:41:11,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:41:11,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:41:11,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:41:11,808 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:41:11,809 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:41:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:11,981 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-10 17:41:11,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:41:11,991 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:41:12,075 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:41:12,081 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:41:12,082 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:41:12,101 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:41:12,103 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:41:12,168 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:41:12,171 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:41:12,251 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:41:12,252 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:41:12,259 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:41:12,312 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:41:12,312 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:41:12,318 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:41:12,330 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:41:12,333 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:41:12,352 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:41:12,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:41:12,444 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_1031 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1031) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1031 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1031) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1030) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-10 17:41:12,487 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1031 (Array Int Int)) (v_ArrVal_1030 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1036))) (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~mem50#1.base| v_ArrVal_1037) .cse0 v_ArrVal_1031) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1030) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 (Array Int Int)) (v_ArrVal_1031 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1037) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1036) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1031) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-10 17:41:12,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286146389] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:41:12,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:41:12,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-10 17:41:12,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700860895] [2024-11-10 17:41:12,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:41:12,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-10 17:41:12,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:41:12,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-10 17:41:12,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=468, Unknown=12, NotChecked=90, Total=650 [2024-11-10 17:41:12,493 INFO L87 Difference]: Start difference. First operand 1656 states and 2109 transitions. Second operand has 21 states, 18 states have (on average 8.11111111111111) internal successors, (146), 20 states have internal predecessors, (146), 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:41:15,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:41:15,243 INFO L93 Difference]: Finished difference Result 1658 states and 2117 transitions. [2024-11-10 17:41:15,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 17:41:15,244 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.11111111111111) internal successors, (146), 20 states have internal predecessors, (146), 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 93 [2024-11-10 17:41:15,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:41:15,246 INFO L225 Difference]: With dead ends: 1658 [2024-11-10 17:41:15,246 INFO L226 Difference]: Without dead ends: 1658 [2024-11-10 17:41:15,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=131, Invalid=735, Unknown=12, NotChecked=114, Total=992 [2024-11-10 17:41:15,247 INFO L432 NwaCegarLoop]: 751 mSDtfsCounter, 1210 mSDsluCounter, 6037 mSDsCounter, 0 mSdLazyCounter, 7205 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 6788 SdHoareTripleChecker+Invalid, 7230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 7205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:41:15,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 6788 Invalid, 7230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 7205 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-10 17:41:15,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1658 states. [2024-11-10 17:41:15,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1658 to 1640. [2024-11-10 17:41:15,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1258 states have (on average 1.6470588235294117) internal successors, (2072), 1628 states have internal predecessors, (2072), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:41:15,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 2090 transitions. [2024-11-10 17:41:15,261 INFO L78 Accepts]: Start accepts. Automaton has 1640 states and 2090 transitions. Word has length 93 [2024-11-10 17:41:15,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:41:15,261 INFO L471 AbstractCegarLoop]: Abstraction has 1640 states and 2090 transitions. [2024-11-10 17:41:15,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.11111111111111) internal successors, (146), 20 states have internal predecessors, (146), 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:41:15,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1640 states and 2090 transitions. [2024-11-10 17:41:15,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 17:41:15,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:41:15,262 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:41:15,276 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:41:15,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:41:15,462 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr522REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:41:15,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:41:15,463 INFO L85 PathProgramCache]: Analyzing trace with hash -276981793, now seen corresponding path program 1 times [2024-11-10 17:41:15,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:41:15,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617745741] [2024-11-10 17:41:15,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:41:15,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:41:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:15,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:41:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:15,874 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:41:15,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:41:15,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617745741] [2024-11-10 17:41:15,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617745741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:41:15,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:41:15,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 17:41:15,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760553987] [2024-11-10 17:41:15,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:41:15,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 17:41:15,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:41:15,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 17:41:15,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-10 17:41:15,876 INFO L87 Difference]: Start difference. First operand 1640 states and 2090 transitions. Second operand has 15 states, 13 states have (on average 7.153846153846154) internal successors, (93), 14 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:41:17,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:41:17,989 INFO L93 Difference]: Finished difference Result 1665 states and 2125 transitions. [2024-11-10 17:41:17,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-10 17:41:17,990 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.153846153846154) internal successors, (93), 14 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-10 17:41:17,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:41:17,992 INFO L225 Difference]: With dead ends: 1665 [2024-11-10 17:41:17,992 INFO L226 Difference]: Without dead ends: 1665 [2024-11-10 17:41:17,993 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:41:17,993 INFO L432 NwaCegarLoop]: 745 mSDtfsCounter, 1219 mSDsluCounter, 7249 mSDsCounter, 0 mSdLazyCounter, 6003 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1229 SdHoareTripleChecker+Valid, 7994 SdHoareTripleChecker+Invalid, 6023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 6003 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-10 17:41:17,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1229 Valid, 7994 Invalid, 6023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 6003 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-10 17:41:17,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2024-11-10 17:41:18,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1661. [2024-11-10 17:41:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1278 states have (on average 1.6392801251956182) internal successors, (2095), 1647 states have internal predecessors, (2095), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-10 17:41:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2115 transitions. [2024-11-10 17:41:18,006 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2115 transitions. Word has length 95 [2024-11-10 17:41:18,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:41:18,007 INFO L471 AbstractCegarLoop]: Abstraction has 1661 states and 2115 transitions. [2024-11-10 17:41:18,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.153846153846154) internal successors, (93), 14 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:41:18,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2115 transitions. [2024-11-10 17:41:18,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-10 17:41:18,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:41:18,007 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:41:18,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 17:41:18,007 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:41:18,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:41:18,008 INFO L85 PathProgramCache]: Analyzing trace with hash -276981792, now seen corresponding path program 1 times [2024-11-10 17:41:18,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:41:18,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567363168] [2024-11-10 17:41:18,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:41:18,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:41:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:18,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:41:18,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:18,596 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:41:18,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:41:18,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567363168] [2024-11-10 17:41:18,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567363168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:41:18,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:41:18,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 17:41:18,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426174255] [2024-11-10 17:41:18,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:41:18,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 17:41:18,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:41:18,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 17:41:18,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-10 17:41:18,598 INFO L87 Difference]: Start difference. First operand 1661 states and 2115 transitions. Second operand has 13 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:41:20,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:41:20,336 INFO L93 Difference]: Finished difference Result 1664 states and 2123 transitions. [2024-11-10 17:41:20,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 17:41:20,337 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-10 17:41:20,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:41:20,339 INFO L225 Difference]: With dead ends: 1664 [2024-11-10 17:41:20,339 INFO L226 Difference]: Without dead ends: 1664 [2024-11-10 17:41:20,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-10 17:41:20,339 INFO L432 NwaCegarLoop]: 752 mSDtfsCounter, 1197 mSDsluCounter, 4519 mSDsCounter, 0 mSdLazyCounter, 4861 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 5271 SdHoareTripleChecker+Invalid, 4880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4861 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-10 17:41:20,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1207 Valid, 5271 Invalid, 4880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4861 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-10 17:41:20,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1664 states. [2024-11-10 17:41:20,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1664 to 1661. [2024-11-10 17:41:20,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1661 states, 1278 states have (on average 1.637715179968701) internal successors, (2093), 1647 states have internal predecessors, (2093), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-10 17:41:20,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 2113 transitions. [2024-11-10 17:41:20,356 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 2113 transitions. Word has length 95 [2024-11-10 17:41:20,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:41:20,356 INFO L471 AbstractCegarLoop]: Abstraction has 1661 states and 2113 transitions. [2024-11-10 17:41:20,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 12 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:41:20,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 2113 transitions. [2024-11-10 17:41:20,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 17:41:20,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:41:20,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:41:20,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 17:41:20,358 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:41:20,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:41:20,358 INFO L85 PathProgramCache]: Analyzing trace with hash -2098303473, now seen corresponding path program 1 times [2024-11-10 17:41:20,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:41:20,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578823897] [2024-11-10 17:41:20,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:41:20,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:41:20,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:20,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:41:20,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:20,775 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:41:20,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:41:20,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578823897] [2024-11-10 17:41:20,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578823897] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:41:20,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164565572] [2024-11-10 17:41:20,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:41:20,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:41:20,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:41:20,777 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:41:20,778 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:41:20,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:20,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 17:41:20,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:41:20,975 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:41:21,044 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:41:21,044 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:41:21,048 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:41:21,104 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:41:21,104 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:41:21,134 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:41:21,135 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:41:21,163 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:41:21,163 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:41:21,170 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:41:21,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 17:41:21,173 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:41:25,356 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-10 17:41:25,356 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:41:25,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164565572] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:41:25,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:41:25,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 19 [2024-11-10 17:41:25,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478939719] [2024-11-10 17:41:25,405 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:41:25,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 17:41:25,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:41:25,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 17:41:25,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=487, Unknown=34, NotChecked=0, Total=600 [2024-11-10 17:41:25,407 INFO L87 Difference]: Start difference. First operand 1661 states and 2113 transitions. Second operand has 20 states, 18 states have (on average 8.0) internal successors, (144), 19 states have internal predecessors, (144), 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:41:28,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:41:28,034 INFO L93 Difference]: Finished difference Result 1663 states and 2121 transitions. [2024-11-10 17:41:28,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 17:41:28,035 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 8.0) internal successors, (144), 19 states have internal predecessors, (144), 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 96 [2024-11-10 17:41:28,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:41:28,037 INFO L225 Difference]: With dead ends: 1663 [2024-11-10 17:41:28,037 INFO L226 Difference]: Without dead ends: 1663 [2024-11-10 17:41:28,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=160, Invalid=924, Unknown=38, NotChecked=0, Total=1122 [2024-11-10 17:41:28,037 INFO L432 NwaCegarLoop]: 745 mSDtfsCounter, 1186 mSDsluCounter, 7208 mSDsCounter, 0 mSdLazyCounter, 5973 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 7953 SdHoareTripleChecker+Invalid, 6004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 5973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-10 17:41:28,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 7953 Invalid, 6004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 5973 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-10 17:41:28,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2024-11-10 17:41:28,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1660. [2024-11-10 17:41:28,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1660 states, 1278 states have (on average 1.636150234741784) internal successors, (2091), 1646 states have internal predecessors, (2091), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-10 17:41:28,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 2111 transitions. [2024-11-10 17:41:28,052 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 2111 transitions. Word has length 96 [2024-11-10 17:41:28,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:41:28,052 INFO L471 AbstractCegarLoop]: Abstraction has 1660 states and 2111 transitions. [2024-11-10 17:41:28,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 8.0) internal successors, (144), 19 states have internal predecessors, (144), 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:41:28,053 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 2111 transitions. [2024-11-10 17:41:28,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-10 17:41:28,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:41:28,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:41:28,068 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:41:28,257 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,SelfDestructingSolverStorable22 [2024-11-10 17:41:28,258 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr523REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:41:28,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:41:28,258 INFO L85 PathProgramCache]: Analyzing trace with hash -2098303472, now seen corresponding path program 1 times [2024-11-10 17:41:28,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:41:28,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311751791] [2024-11-10 17:41:28,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:41:28,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:41:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:28,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:41:28,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:28,954 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:41:28,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:41:28,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311751791] [2024-11-10 17:41:28,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311751791] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:41:28,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805784712] [2024-11-10 17:41:28,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:41:28,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:41:28,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:41:28,957 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:41:28,959 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:41:29,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:29,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-10 17:41:29,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:41:29,174 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:41:29,272 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:41:29,272 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:41:29,295 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:41:29,372 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:41:29,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-10 17:41:29,418 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:41:29,419 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 70 treesize of output 65 [2024-11-10 17:41:29,423 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 40 treesize of output 23 [2024-11-10 17:41:29,491 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:41:29,492 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 70 treesize of output 65 [2024-11-10 17:41:29,496 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 51 treesize of output 32 [2024-11-10 17:41:29,534 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 39 treesize of output 21 [2024-11-10 17:41:29,541 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 34 treesize of output 16 [2024-11-10 17:41:29,566 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:41:29,566 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:41:29,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 17:41:29,745 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 84 treesize of output 88 [2024-11-10 17:41:29,844 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1471 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1471))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1472 (Array Int Int)) (v_prenex_7 (Array Int Int))) (< (select (select (store .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1472) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_prenex_7) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (+ |c_ULTIMATE.start_main_#t~mem52#1.offset| 9)))))) (forall ((v_ArrVal_1473 (Array Int Int)) (v_ArrVal_1472 (Array Int Int)) (v_ArrVal_1471 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1471))) (or (< (+ (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (< 0 (+ (select (select (store .cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1472) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1473) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 9))))) (or (forall ((v_ArrVal_1474 (Array Int Int)) (v_ArrVal_1472 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem52#1.base| (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1472))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1474)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (forall ((v_ArrVal_1471 (Array Int Int))) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1471) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0))))) is different from false [2024-11-10 17:41:29,864 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 601 treesize of output 559 [2024-11-10 17:41:29,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 383 treesize of output 375 [2024-11-10 17:41:29,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 375 treesize of output 367 [2024-11-10 17:41:29,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 367 treesize of output 363 [2024-11-10 17:41:29,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 363 treesize of output 355 [2024-11-10 17:41:29,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 355 treesize of output 347 [2024-11-10 17:41:29,959 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1477 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1477) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) |c_ULTIMATE.start_main_~user~0#1.base|))) is different from false [2024-11-10 17:41:29,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805784712] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:41:29,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:41:29,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2024-11-10 17:41:29,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861291971] [2024-11-10 17:41:29,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:41:29,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 17:41:29,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:41:29,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 17:41:29,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=707, Unknown=2, NotChecked=110, Total=930 [2024-11-10 17:41:29,962 INFO L87 Difference]: Start difference. First operand 1660 states and 2111 transitions. Second operand has 25 states, 22 states have (on average 6.909090909090909) internal successors, (152), 24 states have internal predecessors, (152), 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:41:33,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:41:33,081 INFO L93 Difference]: Finished difference Result 1662 states and 2119 transitions. [2024-11-10 17:41:33,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 17:41:33,081 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 6.909090909090909) internal successors, (152), 24 states have internal predecessors, (152), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2024-11-10 17:41:33,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:41:33,084 INFO L225 Difference]: With dead ends: 1662 [2024-11-10 17:41:33,084 INFO L226 Difference]: Without dead ends: 1662 [2024-11-10 17:41:33,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=180, Invalid=1016, Unknown=2, NotChecked=134, Total=1332 [2024-11-10 17:41:33,084 INFO L432 NwaCegarLoop]: 751 mSDtfsCounter, 1225 mSDsluCounter, 6784 mSDsCounter, 0 mSdLazyCounter, 6458 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1235 SdHoareTripleChecker+Valid, 7535 SdHoareTripleChecker+Invalid, 6479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 6458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:41:33,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1235 Valid, 7535 Invalid, 6479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 6458 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-10 17:41:33,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2024-11-10 17:41:33,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1638. [2024-11-10 17:41:33,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1638 states, 1258 states have (on average 1.643879173290938) internal successors, (2068), 1626 states have internal predecessors, (2068), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:41:33,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2086 transitions. [2024-11-10 17:41:33,106 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2086 transitions. Word has length 96 [2024-11-10 17:41:33,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:41:33,107 INFO L471 AbstractCegarLoop]: Abstraction has 1638 states and 2086 transitions. [2024-11-10 17:41:33,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 6.909090909090909) internal successors, (152), 24 states have internal predecessors, (152), 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:41:33,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2086 transitions. [2024-11-10 17:41:33,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 17:41:33,107 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:41:33,108 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:41:33,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 17:41:33,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:41:33,309 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr518REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:41:33,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:41:33,309 INFO L85 PathProgramCache]: Analyzing trace with hash -931136790, now seen corresponding path program 1 times [2024-11-10 17:41:33,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:41:33,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280715362] [2024-11-10 17:41:33,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:41:33,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:41:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:33,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:41:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:33,825 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:41:33,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:41:33,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280715362] [2024-11-10 17:41:33,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280715362] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:41:33,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:41:33,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-10 17:41:33,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499222990] [2024-11-10 17:41:33,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:41:33,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 17:41:33,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:41:33,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 17:41:33,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-10 17:41:33,827 INFO L87 Difference]: Start difference. First operand 1638 states and 2086 transitions. Second operand has 16 states, 14 states have (on average 6.857142857142857) internal successors, (96), 15 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:41:36,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:41:36,294 INFO L93 Difference]: Finished difference Result 1669 states and 2127 transitions. [2024-11-10 17:41:36,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 17:41:36,295 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.857142857142857) internal successors, (96), 15 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-10 17:41:36,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:41:36,297 INFO L225 Difference]: With dead ends: 1669 [2024-11-10 17:41:36,297 INFO L226 Difference]: Without dead ends: 1669 [2024-11-10 17:41:36,297 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:41:36,298 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 1266 mSDsluCounter, 6520 mSDsCounter, 0 mSdLazyCounter, 5453 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1276 SdHoareTripleChecker+Valid, 7264 SdHoareTripleChecker+Invalid, 5474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 5453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:41:36,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1276 Valid, 7264 Invalid, 5474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 5453 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 17:41:36,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2024-11-10 17:41:36,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1665. [2024-11-10 17:41:36,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1284 states have (on average 1.6331775700934579) internal successors, (2097), 1651 states have internal predecessors, (2097), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-10 17:41:36,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2117 transitions. [2024-11-10 17:41:36,313 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2117 transitions. Word has length 98 [2024-11-10 17:41:36,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:41:36,313 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2117 transitions. [2024-11-10 17:41:36,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.857142857142857) internal successors, (96), 15 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:41:36,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2117 transitions. [2024-11-10 17:41:36,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-10 17:41:36,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:41:36,314 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:41:36,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 17:41:36,314 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:41:36,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:41:36,315 INFO L85 PathProgramCache]: Analyzing trace with hash -931136789, now seen corresponding path program 1 times [2024-11-10 17:41:36,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:41:36,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193177426] [2024-11-10 17:41:36,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:41:36,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:41:36,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:36,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:41:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:36,981 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:41:36,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:41:36,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193177426] [2024-11-10 17:41:36,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193177426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:41:36,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:41:36,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-10 17:41:36,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855435409] [2024-11-10 17:41:36,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:41:36,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-10 17:41:36,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:41:36,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-10 17:41:36,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-10 17:41:36,983 INFO L87 Difference]: Start difference. First operand 1665 states and 2117 transitions. Second operand has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:41:40,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:41:40,466 INFO L93 Difference]: Finished difference Result 1668 states and 2125 transitions. [2024-11-10 17:41:40,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 17:41:40,466 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2024-11-10 17:41:40,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:41:40,468 INFO L225 Difference]: With dead ends: 1668 [2024-11-10 17:41:40,469 INFO L226 Difference]: Without dead ends: 1668 [2024-11-10 17:41:40,469 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:41:40,469 INFO L432 NwaCegarLoop]: 751 mSDtfsCounter, 1237 mSDsluCounter, 5955 mSDsCounter, 0 mSdLazyCounter, 7174 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1247 SdHoareTripleChecker+Valid, 6706 SdHoareTripleChecker+Invalid, 7198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 7174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:41:40,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1247 Valid, 6706 Invalid, 7198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 7174 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-10 17:41:40,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1668 states. [2024-11-10 17:41:40,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1668 to 1665. [2024-11-10 17:41:40,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1665 states, 1284 states have (on average 1.631619937694704) internal successors, (2095), 1651 states have internal predecessors, (2095), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-10 17:41:40,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1665 states to 1665 states and 2115 transitions. [2024-11-10 17:41:40,483 INFO L78 Accepts]: Start accepts. Automaton has 1665 states and 2115 transitions. Word has length 98 [2024-11-10 17:41:40,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:41:40,483 INFO L471 AbstractCegarLoop]: Abstraction has 1665 states and 2115 transitions. [2024-11-10 17:41:40,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.384615384615385) internal successors, (96), 13 states have internal predecessors, (96), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-10 17:41:40,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1665 states and 2115 transitions. [2024-11-10 17:41:40,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 17:41:40,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:41:40,484 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:41:40,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 17:41:40,484 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:41:40,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:41:40,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1603455302, now seen corresponding path program 1 times [2024-11-10 17:41:40,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:41:40,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67276652] [2024-11-10 17:41:40,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:41:40,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:41:40,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:40,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:41:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:40,959 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:41:40,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:41:40,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67276652] [2024-11-10 17:41:40,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67276652] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:41:40,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [647285961] [2024-11-10 17:41:40,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:41:40,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:41:40,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:41:40,962 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:41:40,963 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:41:41,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:41,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-10 17:41:41,154 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:41:41,158 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:41:41,251 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:41:41,251 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:41:41,257 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:41:41,328 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:41:41,329 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:41:41,372 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:41:41,372 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:41:41,415 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:41:41,415 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:41:41,464 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:41:41,464 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:41:41,476 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:41:41,479 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:41:41,479 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:41:41,520 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1782 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1782) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-10 17:41:41,610 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1782 (Array Int Int)) (v_ArrVal_1781 (Array Int Int)) (v_ArrVal_1780 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1780))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1781)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1782)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-10 17:41:41,690 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-10 17:41:41,691 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 105 treesize of output 104 [2024-11-10 17:41:41,697 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1785 (Array Int Int)) (v_ArrVal_1782 (Array Int Int)) (v_ArrVal_1781 (Array Int Int)) (v_ArrVal_1780 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1785))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1780)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1781)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1782)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-10 17:41:41,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [647285961] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:41:41,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:41:41,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 21 [2024-11-10 17:41:41,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474240065] [2024-11-10 17:41:41,699 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:41:41,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-10 17:41:41,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:41:41,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-10 17:41:41,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=517, Unknown=47, NotChecked=150, Total=812 [2024-11-10 17:41:41,700 INFO L87 Difference]: Start difference. First operand 1665 states and 2115 transitions. Second operand has 22 states, 20 states have (on average 7.45) internal successors, (149), 21 states have internal predecessors, (149), 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:41:45,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:41:45,455 INFO L93 Difference]: Finished difference Result 1667 states and 2123 transitions. [2024-11-10 17:41:45,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 17:41:45,456 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 7.45) internal successors, (149), 21 states have internal predecessors, (149), 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 99 [2024-11-10 17:41:45,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:41:45,458 INFO L225 Difference]: With dead ends: 1667 [2024-11-10 17:41:45,459 INFO L226 Difference]: Without dead ends: 1667 [2024-11-10 17:41:45,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=1028, Unknown=55, NotChecked=210, Total=1482 [2024-11-10 17:41:45,459 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 1180 mSDsluCounter, 10070 mSDsCounter, 0 mSdLazyCounter, 8151 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 10814 SdHoareTripleChecker+Invalid, 8177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 8151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-10 17:41:45,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 10814 Invalid, 8177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 8151 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-10 17:41:45,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2024-11-10 17:41:45,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1664. [2024-11-10 17:41:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1664 states, 1284 states have (on average 1.6300623052959502) internal successors, (2093), 1650 states have internal predecessors, (2093), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-10 17:41:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2113 transitions. [2024-11-10 17:41:45,473 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2113 transitions. Word has length 99 [2024-11-10 17:41:45,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:41:45,474 INFO L471 AbstractCegarLoop]: Abstraction has 1664 states and 2113 transitions. [2024-11-10 17:41:45,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 7.45) internal successors, (149), 21 states have internal predecessors, (149), 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:41:45,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2113 transitions. [2024-11-10 17:41:45,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-10 17:41:45,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:41:45,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:41:45,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-10 17:41:45,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:41:45,675 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr519REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:41:45,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:41:45,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1603455301, now seen corresponding path program 1 times [2024-11-10 17:41:45,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:41:45,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025354781] [2024-11-10 17:41:45,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:41:45,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:41:45,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:46,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:41:46,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:46,407 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:41:46,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:41:46,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025354781] [2024-11-10 17:41:46,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025354781] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:41:46,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764518518] [2024-11-10 17:41:46,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:41:46,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 17:41:46,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 17:41:46,409 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 17:41:46,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 17:41:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:46,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 482 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-10 17:41:46,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 17:41:46,627 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:41:46,712 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 17:41:46,713 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:41:46,718 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:41:46,739 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:41:46,746 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:41:46,825 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:41:46,829 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:41:46,922 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:41:46,922 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:41:46,928 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:41:47,002 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2024-11-10 17:41:47,002 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 67 treesize of output 39 [2024-11-10 17:41:47,013 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:41:47,113 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-10 17:41:47,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 64 [2024-11-10 17:41:47,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 7 treesize of output 3 [2024-11-10 17:41:47,119 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:41:47,178 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-10 17:41:47,179 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:41:47,184 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:41:47,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-10 17:41:47,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-10 17:41:47,222 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:41:47,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 17:41:47,270 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1957) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1956) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1957 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1957) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))))) is different from false [2024-11-10 17:41:47,280 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_1956 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1957) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1956) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1957 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1957) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2024-11-10 17:41:47,303 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1955 (Array Int Int)) (v_ArrVal_1954 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1955) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1954) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1957) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20))) (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1955 (Array Int Int)) (v_ArrVal_1954 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1954))) (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~mem53#1.base| v_ArrVal_1955) .cse1 v_ArrVal_1957) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 24) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1956) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-10 17:41:47,397 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8)) (.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base|))) (and (forall ((v_ArrVal_1955 (Array Int Int)) (v_ArrVal_1954 (Array Int Int)) (|ULTIMATE.start_main_#t~mem52#1.offset| Int) (v_ArrVal_1952 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| (store .cse3 (+ |ULTIMATE.start_main_#t~mem52#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|)))) (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~mem52#1.base| v_ArrVal_1952) .cse0 v_ArrVal_1955) (select (select (store .cse1 .cse0 v_ArrVal_1954) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1957))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1955 (Array Int Int)) (v_ArrVal_1954 (Array Int Int)) (|ULTIMATE.start_main_#t~mem52#1.offset| Int) (v_ArrVal_1952 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| (store .cse3 (+ |ULTIMATE.start_main_#t~mem52#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_1954))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1952) .cse4 v_ArrVal_1955) .cse5 v_ArrVal_1957) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1956) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-10 17:41:47,418 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |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|) .cse3))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse0))) (and (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1955 (Array Int Int)) (v_ArrVal_1954 (Array Int Int)) (|ULTIMATE.start_main_#t~mem52#1.offset| Int) (v_ArrVal_1952 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 (store .cse6 (+ |ULTIMATE.start_main_#t~mem52#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1954))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1952) .cse1 v_ArrVal_1955) .cse2 v_ArrVal_1957) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1956) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_1955 (Array Int Int)) (v_ArrVal_1954 (Array Int Int)) (|ULTIMATE.start_main_#t~mem52#1.offset| Int) (v_ArrVal_1952 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse8 (store |c_#memory_$Pointer$#1.base| .cse0 (store .cse6 (+ |ULTIMATE.start_main_#t~mem52#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1952) .cse7 v_ArrVal_1955) (select (select (store .cse8 .cse7 v_ArrVal_1954) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1957))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))))))) is different from false [2024-11-10 17:41:47,492 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1956 (Array Int Int)) (v_ArrVal_1955 (Array Int Int)) (v_ArrVal_1954 (Array Int Int)) (|ULTIMATE.start_main_#t~mem52#1.offset| Int) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1952 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1962))) (let ((.cse0 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse5 (store .cse6 .cse0 (store (select .cse6 .cse0) (+ |ULTIMATE.start_main_#t~mem52#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1954))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1963) .cse0 v_ArrVal_1952) .cse1 v_ArrVal_1955) .cse2 v_ArrVal_1957) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1956) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1955 (Array Int Int)) (v_ArrVal_1954 (Array Int Int)) (|ULTIMATE.start_main_#t~mem52#1.offset| Int) (v_ArrVal_1963 (Array Int Int)) (v_ArrVal_1952 (Array Int Int)) (v_ArrVal_1962 (Array Int Int)) (v_ArrVal_1957 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1962))) (let ((.cse7 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse7 (store (select .cse10 .cse7) (+ |ULTIMATE.start_main_#t~mem52#1.offset| 16) |c_ULTIMATE.start_main_~user~0#1.base|)))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1963) .cse7 v_ArrVal_1952) .cse8 v_ArrVal_1955) (select (select (store .cse9 .cse8 v_ArrVal_1954) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1957))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))) is different from false [2024-11-10 17:41:47,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764518518] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 17:41:47,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 17:41:47,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2024-11-10 17:41:47,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687399379] [2024-11-10 17:41:47,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 17:41:47,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 17:41:47,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:41:47,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 17:41:47,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=706, Unknown=9, NotChecked=354, Total=1190 [2024-11-10 17:41:47,497 INFO L87 Difference]: Start difference. First operand 1664 states and 2113 transitions. Second operand has 26 states, 23 states have (on average 6.869565217391305) internal successors, (158), 25 states have internal predecessors, (158), 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:41:52,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:41:52,683 INFO L93 Difference]: Finished difference Result 1666 states and 2121 transitions. [2024-11-10 17:41:52,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 17:41:52,683 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 6.869565217391305) internal successors, (158), 25 states have internal predecessors, (158), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 99 [2024-11-10 17:41:52,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:41:52,685 INFO L225 Difference]: With dead ends: 1666 [2024-11-10 17:41:52,685 INFO L226 Difference]: Without dead ends: 1666 [2024-11-10 17:41:52,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=1212, Unknown=9, NotChecked=462, Total=1892 [2024-11-10 17:41:52,686 INFO L432 NwaCegarLoop]: 749 mSDtfsCounter, 1230 mSDsluCounter, 7660 mSDsCounter, 0 mSdLazyCounter, 9335 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1240 SdHoareTripleChecker+Valid, 8409 SdHoareTripleChecker+Invalid, 9364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 9335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-10 17:41:52,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1240 Valid, 8409 Invalid, 9364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 9335 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-10 17:41:52,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2024-11-10 17:41:52,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1636. [2024-11-10 17:41:52,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1636 states, 1258 states have (on average 1.6406995230524641) internal successors, (2064), 1624 states have internal predecessors, (2064), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-10 17:41:52,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2082 transitions. [2024-11-10 17:41:52,698 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2082 transitions. Word has length 99 [2024-11-10 17:41:52,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:41:52,698 INFO L471 AbstractCegarLoop]: Abstraction has 1636 states and 2082 transitions. [2024-11-10 17:41:52,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 6.869565217391305) internal successors, (158), 25 states have internal predecessors, (158), 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:41:52,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2082 transitions. [2024-11-10 17:41:52,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 17:41:52,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:41:52,699 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:41:52,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-10 17:41:52,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-10 17:41:52,899 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr514REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:41:52,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:41:52,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1127220068, now seen corresponding path program 1 times [2024-11-10 17:41:52,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:41:52,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165073112] [2024-11-10 17:41:52,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:41:52,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:41:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:53,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:41:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:53,486 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:41:53,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:41:53,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165073112] [2024-11-10 17:41:53,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165073112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:41:53,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:41:53,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-10 17:41:53,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255218475] [2024-11-10 17:41:53,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:41:53,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-10 17:41:53,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:41:53,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-10 17:41:53,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2024-11-10 17:41:53,487 INFO L87 Difference]: Start difference. First operand 1636 states and 2082 transitions. Second operand has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 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:41:55,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 17:41:55,892 INFO L93 Difference]: Finished difference Result 1675 states and 2131 transitions. [2024-11-10 17:41:55,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 17:41:55,892 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 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 102 [2024-11-10 17:41:55,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 17:41:55,894 INFO L225 Difference]: With dead ends: 1675 [2024-11-10 17:41:55,894 INFO L226 Difference]: Without dead ends: 1675 [2024-11-10 17:41:55,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2024-11-10 17:41:55,894 INFO L432 NwaCegarLoop]: 749 mSDtfsCounter, 1261 mSDsluCounter, 6507 mSDsCounter, 0 mSdLazyCounter, 5449 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1271 SdHoareTripleChecker+Valid, 7256 SdHoareTripleChecker+Invalid, 5470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 5449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-10 17:41:55,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1271 Valid, 7256 Invalid, 5470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 5449 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-10 17:41:55,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1675 states. [2024-11-10 17:41:55,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1675 to 1671. [2024-11-10 17:41:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1671 states, 1292 states have (on average 1.6261609907120742) internal successors, (2101), 1657 states have internal predecessors, (2101), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-10 17:41:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 2121 transitions. [2024-11-10 17:41:55,907 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 2121 transitions. Word has length 102 [2024-11-10 17:41:55,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 17:41:55,907 INFO L471 AbstractCegarLoop]: Abstraction has 1671 states and 2121 transitions. [2024-11-10 17:41:55,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.142857142857143) internal successors, (100), 14 states have internal predecessors, (100), 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:41:55,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 2121 transitions. [2024-11-10 17:41:55,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-10 17:41:55,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 17:41:55,908 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 17:41:55,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 17:41:55,908 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr515REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-10 17:41:55,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 17:41:55,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1127220069, now seen corresponding path program 1 times [2024-11-10 17:41:55,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 17:41:55,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057672407] [2024-11-10 17:41:55,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 17:41:55,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 17:41:55,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:56,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 17:41:56,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 17:41:56,780 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:41:56,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 17:41:56,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057672407] [2024-11-10 17:41:56,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057672407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 17:41:56,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 17:41:56,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-10 17:41:56,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458765184] [2024-11-10 17:41:56,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 17:41:56,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 17:41:56,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 17:41:56,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 17:41:56,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-10 17:41:56,782 INFO L87 Difference]: Start difference. First operand 1671 states and 2121 transitions. Second operand has 18 states, 16 states have (on average 6.25) internal successors, (100), 17 states have internal predecessors, (100), 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)